TLE in FAST2

[daarthvader]

How come my code is giving TLE on spoj but its giving output in 0.09 s on IDEONE?
And is there any other way to optimise my solution?
here is my code

t=input()
i=0
while i<t:
    n=input()
    sum=2**(n+1)
    sum=sum-1
    sum=sum%1298074214633706835075030044377087
    print (sum)
    i+=1

[gorlum0_sof]

How come my code is giving TLE on spoj but its giving output in 0.09 s on IDEONE?

Because spoj uses much slower machines, not ideone's.

[daarthvader]

okay thanx for notifying me!!
also can u help me up to optimise the solution then?

[francky]

Not so far

[venkikumar_m]

.

[numerix]

If you need help with your Java code, you should use the Java subforum, not Python.