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 listMay 25, 2026 18:22Maya RebholzMaya RebholzScore: 7,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 18:226,97567,820,92452,781,0005,112,0002,117,632
2May 25, 2026 18:227,00167,541,94952,802,0005,310,0002,113,536
3May 25, 2026 18:227,07868,762,59453,376,0005,379,0002,117,632
4May 25, 2026 18:227,08168,300,67453,376,0005,398,0002,117,632
5May 25, 2026 18:227,08570,815,15753,173,0005,633,0002,117,632
6May 25, 2026 18:227,12870,950,56653,589,0005,577,0002,113,536
7May 25, 2026 18:227,14869,172,82953,846,0005,487,0002,117,632
8May 25, 2026 18:227,16169,751,39753,701,0005,738,0002,113,536
9May 25, 2026 18:227,61373,944,25557,564,0005,628,0002,117,632