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 21, 2026 23:15Juraj ZelmanJuraj ZelmanScore: 7,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 23:157,12688,236,68658,140,0001,002,0002,478,080
2Feb 21, 2026 23:157,12982,215,64457,164,0002,005,0002,363,392
3Feb 21, 2026 23:157,12982,963,85958,172,0001,002,0002,363,392
4Feb 21, 2026 23:157,14085,181,60358,257,0001,004,0002,367,488
5Feb 21, 2026 23:157,15183,229,75359,356,00002,293,760
6Feb 21, 2026 23:157,15682,844,33559,391,00002,293,760
7Feb 21, 2026 23:157,16381,161,98559,457,00002,367,488
8Feb 21, 2026 23:157,17280,744,66358,517,0001,008,0002,293,760
9Feb 21, 2026 23:157,17386,384,29959,535,00002,355,200
10Feb 21, 2026 23:157,18188,122,14959,605,00002,293,760
11Feb 21, 2026 23:157,29885,290,51659,562,0001,009,0002,293,760
12Feb 21, 2026 23:157,35090,927,68659,008,0002,000,0002,367,488