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 18:18Victor MerckléVictor MerckléScore: 4,829Success
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 18:194,79747,637,80638,767,0001,051,0002,113,536
2May 20, 2026 18:194,81049,583,75138,901,0001,026,0002,113,536
3May 20, 2026 18:194,81647,765,64438,954,0001,020,0002,113,536
4May 20, 2026 18:194,82449,122,92439,027,0001,019,0002,113,536
5May 20, 2026 18:194,82949,141,83639,084,0001,002,0002,113,536
6May 20, 2026 18:194,83049,703,44338,984,0001,105,0002,113,536
7May 20, 2026 18:194,83648,042,03739,117,0001,029,0002,113,536
8May 20, 2026 18:194,84149,632,23139,161,0001,022,0002,113,536
9May 20, 2026 18:195,01249,496,22440,537,0001,066,0002,113,536