Divisor Summation TLE

[charlie_yu]

I tried a O(sqrt n) algorithm but got TLE. I tested the I/O with the script below and it already takes 2.24s! The best Python3 solution is <2s, how is that possible?

m=input()
d=[]
import sys

for L in sys.stdin:
m=int(L)

d.append(1)

print('\n'.join(map(str,d)))

[francky]

I have one of the fastest C solution, and I cannot yet do it in Python3, but in Python2 I could do it with IO like you.
I think numerix knows secrets for much faster IO for this problem, I don't know them.

So I recommend you to try it in Python2, it's feasible and not so hard.

[daft_wullie]

I usually use

sys.stdout.write

to output the results for SPOJ. But I never timed it in comparison to 'print' for Python 3 scripts...