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 11, 2026 14:19Victor MerckléVictor MerckléScore: 10,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:1910,23093,654,14083,810,0001,102,0002,113,536
2May 11, 2026 14:1910,24497,183,15783,858,0001,173,0002,113,536
3May 11, 2026 14:1910,24896,053,76883,870,0001,189,0002,113,536
4May 11, 2026 14:1910,24895,535,79183,871,0001,190,0002,113,536
5May 11, 2026 14:1910,24896,623,73483,865,0001,194,0002,113,536
6May 11, 2026 14:1910,24895,912,92983,882,0001,183,0002,113,536
7May 11, 2026 14:1910,24993,772,94683,878,0001,194,0002,113,536
8May 11, 2026 14:1910,25499,265,93984,100,0001,013,0002,113,536
9May 11, 2026 14:1910,25593,829,97684,085,0001,038,0002,113,536