I've tried asking about the performance on the HackerRank discussion forum, it didn't work out.
The task is to write a program with three operations:
1 x Push the element x onto the stack. 2 Delete the element present at the top of the stack. 3 Print the maximum element in the stack.
The first input line is the number of lines in the program, all subsequent lines are one of the three instructions.
10 1 97 2 1 20 2 1 26 1 20 2 3 1 91 3
data =  for _ in range(int(input())): ins = input().split() if ins == '1': data.append(int(ins)) elif ins == '2': data.pop() else: print(max(data))
It gets slow on working with input size of 1000 elements or so, how could I speed this up?