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 listFeb 8, 2026 06:15Brian ChewBrian ChewScore: 368,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 06:15368,5553,085,061,2072,976,062,00082,945,0002,502,656
2Feb 8, 2026 06:15368,6543,086,717,5902,994,877,00064,953,0002,289,664
3Feb 8, 2026 06:15368,7513,083,536,5012,999,659,00060,972,0002,510,848
4Feb 8, 2026 06:15368,7783,087,541,3742,998,881,00061,976,0002,293,760
5Feb 8, 2026 06:15368,8053,090,373,6362,990,127,00070,955,0002,285,568
6Feb 8, 2026 06:15369,1813,086,380,0512,992,249,00071,957,0002,502,656
7Feb 8, 2026 06:15371,5783,115,768,8952,999,147,00084,947,0002,285,568
8Feb 8, 2026 06:15373,8183,126,298,9873,033,723,00068,970,0002,293,760
9Feb 8, 2026 06:15377,6273,165,347,5173,059,345,00074,959,0002,510,848