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 2, 2026 10:52Victor MerckléVictor MerckléScore: 4,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:534,31643,835,38234,731,0001,095,0002,117,632stderr
2Jul 2, 2026 10:534,39944,323,95035,388,0001,127,0002,117,632stderr
3Jul 2, 2026 10:534,40044,251,14835,421,0001,105,0002,117,632stderr
4Jul 2, 2026 10:534,42144,551,93935,580,0001,121,0002,117,632stderr
5Jul 2, 2026 10:534,43544,566,80435,767,0001,049,0002,117,632stderr
6Jul 2, 2026 10:534,44344,705,25135,830,0001,049,0002,117,632stderr
7Jul 2, 2026 10:534,45044,717,50535,831,0001,110,0002,117,632stderr
8Jul 2, 2026 10:534,46344,787,45535,943,0001,102,0002,117,632stderr
9Jul 2, 2026 10:534,47044,811,64236,090,0001,011,0002,117,632stderr