HackerRank Tuples problem solution in python

In this Hackerrank tuples problem solution in python, Given an integer, n, and n space-separated integers as input, create a tuple, t, of those n integers. Then compute and print the result of hash(t).

Problem solution in Python 2 programming.

n=int(input())
a=tuple(map(int,raw_input().split()))
print hash(a)

Problem solution in Python 3 programming.

if __name__ == '__main__':
    n = int(input())
    integer_list = map(int, input().split())
    tup = ()
    for x in integer_list:
        tup+=(x,)
    
    print(hash(tup))

Problem solution in pypy programming.

if __name__ == '__main__':
    n = int(raw_input())
    integer_list = map(int, raw_input().split())
    tupl = tuple(integer_list)
    print hash(tupl)

Problem solution in pypy3 programming.

if __name__ == '__main__':
    n = int(input())
    integer_list = map(int, input().split())
    t = tuple(integer_list)
    print(hash(t))