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 11, 2026 07:29wnwnScore: 3,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:293,28635,877,13726,270,0001,010,0002,113,536
2May 11, 2026 07:293,31134,899,09427,488,00002,113,536
3May 11, 2026 07:293,31334,725,63526,460,0001,044,0002,113,536
4May 11, 2026 07:293,31637,767,54826,524,0001,002,0002,113,536
5May 11, 2026 07:293,42736,605,34828,449,00002,113,536
6May 11, 2026 07:293,44136,891,37828,568,00002,113,536
7May 11, 2026 07:293,46337,215,80128,749,00002,113,536
8May 11, 2026 07:293,47236,712,90728,823,00002,113,536
9May 11, 2026 07:293,47636,052,46228,852,00002,113,536