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 19, 2026 16:04Victor MerckléVictor MerckléScore: 6,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:056,14360,489,13549,966,0001,025,0002,113,536
2May 19, 2026 16:056,15959,346,17750,084,0001,039,0002,113,536
3May 19, 2026 16:056,16558,996,48450,153,0001,023,0002,113,536
4May 19, 2026 16:056,16962,117,03950,183,0001,021,0002,113,536
5May 19, 2026 16:056,18659,813,79250,336,0001,013,0002,113,536
6May 19, 2026 16:056,33960,421,09951,590,0001,027,0002,113,536
7May 19, 2026 16:056,35262,745,97151,703,0001,022,0002,113,536
8May 19, 2026 16:056,37360,683,53651,875,0001,025,0002,113,536
9May 19, 2026 16:056,38761,226,87052,014,0001,002,0002,113,536