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:48Josu San MartinJosu San MartinScore: 4,363Success
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:484,32053,547,34234,747,0001,117,0002,555,904
2May 10, 2026 04:484,32151,622,59534,730,0001,136,0002,555,904
3May 10, 2026 04:484,35554,125,94334,995,0001,152,0002,555,904
4May 10, 2026 04:484,36351,108,52135,043,0001,177,0002,551,808
5May 10, 2026 04:484,36351,663,97035,184,0001,034,0002,547,712
6May 10, 2026 04:484,36953,609,67035,180,0001,085,0002,535,424
7May 10, 2026 04:484,37053,795,28035,231,0001,044,0002,547,712
8May 10, 2026 04:484,37951,944,01335,301,0001,045,0002,547,712
9May 10, 2026 04:484,42653,849,21335,697,0001,046,0002,551,808