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 listJul 9, 2026 18:02Victor MerckléVictor MerckléScore: 4,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 18:034,47144,958,47835,975,0001,139,0002,117,632stderr
2Jul 9, 2026 18:034,48345,300,85536,155,0001,056,0002,117,632stderr
3Jul 9, 2026 18:034,48645,370,45236,125,0001,117,0002,117,632stderr
4Jul 9, 2026 18:034,49547,484,14936,231,0001,083,0002,117,632stderr
5Jul 9, 2026 18:034,50145,491,20536,336,0001,030,0002,117,632stderr
6Jul 9, 2026 18:034,50845,282,28336,377,0001,040,0002,117,632stderr
7Jul 9, 2026 18:034,51645,390,82536,362,0001,127,0002,117,632stderr
8Jul 9, 2026 18:034,56445,910,40236,763,0001,122,0002,117,632stderr
9Jul 9, 2026 18:034,66746,569,29837,666,0001,075,0002,117,632stderr