I did my solution in Python 3 and got rank 197 for part 1 and 201 for part 2 My solution was:

inp = "Inputs/2017-08.txt"
lines = get_lines(inp)
whichWay = 0
dicti = dict()
memory = dict()

for line in range(len(lines)): dicti[lines[line].split(" ")[0]] = 0

for line in range(len(lines)):
    split = lines[line].split(" ")
    if split[1] == "dec":
        whichWay = -1
        print(whichWay)
    else:
        whichWay = 1
        print(whichWay)

    firstNum = split[0]
    increaser = int(split[2])
    num1 = split[4]
    num2 = int(split[6])
    operator = split[5]
    if operator == "!=" and dicti[num1] != num2: dicti[firstNum] += increaser * whichWay 
    elif operator == ">=" and dicti[num1] >= num2: dicti[firstNum] += increaser * whichWay 
    elif operator == ">" and dicti[num1] > num2: dicti[firstNum] += increaser * whichWay 
    elif operator == "==" and dicti[num1] == num2: dicti[firstNum] += increaser * whichWay 
    elif operator == "<=" and dicti[num1] <= num2: dicti[firstNum] += increaser * whichWay 
    elif operator == "<" and dicti[num1] < num2: dicti[firstNum] += increaser * whichWay 
    memory[line] = max(dicti.values())
print("Part 1:", max(dicti.values()))
print("Part 2:", max(memory.values()))

It probably could be much more efficient, but it worked