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 24, 2026 20:08Victor MerckléVictor MerckléScore: 4,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:094,56145,680,77736,764,0001,095,0002,113,536
2May 24, 2026 20:094,57446,339,31536,889,0001,077,0002,113,536
3May 24, 2026 20:094,58146,621,17836,960,0001,068,0002,113,536
4May 24, 2026 20:094,58648,011,45537,027,0001,040,0002,113,536
5May 24, 2026 20:094,58847,121,97337,084,0001,002,0002,113,536
6May 24, 2026 20:094,59447,698,56337,053,0001,079,0002,113,536
7May 24, 2026 20:094,60448,017,11337,199,0001,016,0002,113,536
8May 24, 2026 20:094,76749,945,97138,530,0001,037,0002,113,536
9May 24, 2026 20:094,78547,491,89138,663,0001,055,0002,113,536