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 22, 2026 07:13Victor MerckléVictor MerckléScore: 4,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 07:144,56149,529,22636,797,0001,067,0002,113,536
2May 22, 2026 07:144,56247,834,84936,793,0001,077,0002,113,536
3May 22, 2026 07:144,56347,463,18236,800,0001,075,0002,113,536
4May 22, 2026 07:144,56846,536,13136,855,0001,063,0002,113,536
5May 22, 2026 07:144,56846,065,68236,855,0001,066,0002,113,536
6May 22, 2026 07:144,56946,375,89636,875,0001,052,0002,113,536
7May 22, 2026 07:144,58047,457,14836,979,0001,037,0002,113,536
8May 22, 2026 07:144,58945,887,43737,072,0001,021,0002,113,536
9May 22, 2026 07:144,69247,515,22237,902,0001,049,0002,113,536