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 16, 2026 03:38Victor MerckléVictor MerckléScore: 6,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 03:386,94867,839,61356,666,0001,003,0002,113,536
2May 16, 2026 03:386,94866,045,03057,675,00002,113,536
3May 16, 2026 03:386,94965,027,06757,681,00002,113,536
4May 16, 2026 03:386,94967,786,22856,665,0001,014,0002,113,536
5May 16, 2026 03:386,95064,961,41756,680,0001,007,0002,113,536
6May 16, 2026 03:386,95467,563,24256,711,0001,010,0002,113,536
7May 16, 2026 03:386,95567,305,79656,692,0001,041,0002,113,536
8May 16, 2026 03:386,97165,101,03757,862,00002,113,536
9May 16, 2026 03:387,00566,493,17857,132,0001,015,0002,113,536