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 10, 2026 04:28Josu San MartinJosu San MartinScore: 4,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:294,24052,223,30834,053,0001,141,0002,543,616
2May 10, 2026 04:294,26451,296,66234,219,0001,179,0002,547,712
3May 10, 2026 04:294,28251,012,14134,509,0001,035,0002,555,904
4May 10, 2026 04:294,29251,963,80734,514,0001,113,0002,547,712
5May 10, 2026 04:294,29751,981,00534,629,0001,037,0002,543,616
6May 10, 2026 04:294,29753,938,84134,607,0001,064,0002,555,904
7May 10, 2026 04:294,29951,083,98334,626,0001,060,0002,551,808
8May 10, 2026 04:294,30952,753,15934,724,0001,045,0002,535,424
9May 10, 2026 04:294,32451,803,97034,719,0001,173,0002,560,000