Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 22, 2026 18:28stdkFeanorstdkFeanorScore: 69,968Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2026 18:2969,555588,529,548576,237,0001,071,0002,113,536
2Sep 22, 2026 18:2969,565588,541,013576,331,0001,063,0002,113,536
3Sep 22, 2026 18:2969,599588,161,443576,561,0001,117,0002,113,536
4Sep 22, 2026 18:2969,629589,157,107576,923,0001,005,0002,113,536
5Sep 22, 2026 18:2969,968591,194,998579,676,0001,060,0002,113,536
6Sep 22, 2026 18:2969,994592,164,515579,855,0001,096,0002,113,536
7Sep 22, 2026 18:2970,004591,512,118579,953,0001,086,0002,113,536
8Sep 22, 2026 18:2970,009592,328,451580,072,0001,005,0002,113,536
9Sep 22, 2026 18:2970,036592,032,347580,299,0001,008,0002,113,536