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 20, 2026 10:06Victor MerckléVictor MerckléScore: 6,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:076,20859,368,37950,511,0001,022,0002,113,536
2May 20, 2026 10:076,20959,481,55450,518,0001,021,0002,113,536
3May 20, 2026 10:076,23659,724,65650,740,0001,025,0002,113,536
4May 20, 2026 10:076,24059,605,47650,796,0001,001,0002,113,536
5May 20, 2026 10:076,24260,525,08550,768,0001,044,0002,113,536
6May 20, 2026 10:076,27561,925,41851,080,0001,003,0002,113,536
7May 20, 2026 10:076,30162,037,88951,277,0001,024,0002,113,536
8May 20, 2026 10:076,41664,013,57252,222,0001,034,0002,113,536
9May 20, 2026 10:076,47961,622,65052,741,0001,040,0002,113,536