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 12, 2026 00:35Victor MerckléVictor MerckléScore: 10,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:3610,09692,715,56882,700,0001,101,0002,113,536
2May 12, 2026 00:3610,09893,368,75782,712,0001,105,0002,113,536
3May 12, 2026 00:3610,10093,281,04382,723,0001,109,0002,113,536
4May 12, 2026 00:3610,10892,596,48882,738,0001,161,0002,113,536
5May 12, 2026 00:3610,10892,903,83482,735,0001,165,0002,113,536
6May 12, 2026 00:3610,11394,158,92882,779,0001,163,0002,113,536
7May 12, 2026 00:3610,11592,714,27482,951,0001,004,0002,113,536
8May 12, 2026 00:3610,11592,750,48182,787,0001,175,0002,113,536
9May 12, 2026 00:3610,12694,204,20482,945,0001,103,0002,113,536