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 7, 2026 05:37Victor MerckléVictor MerckléScore: 4,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:384,46244,892,60036,002,0001,035,0002,117,632stderr
2Jul 7, 2026 05:384,46744,973,88736,031,0001,046,0002,117,632stderr
3Jul 7, 2026 05:384,47145,201,19936,060,0001,050,0002,117,632stderr
4Jul 7, 2026 05:384,47444,976,46836,081,0001,055,0002,117,632stderr
5Jul 7, 2026 05:384,47645,001,27436,116,0001,042,0002,117,632stderr
6Jul 7, 2026 05:384,47945,103,15336,126,0001,051,0002,117,632stderr
7Jul 7, 2026 05:384,48245,084,95736,130,0001,074,0002,117,632stderr
8Jul 7, 2026 05:384,48345,172,48635,980,0001,232,0002,117,632stderr
9Jul 7, 2026 05:384,58448,619,02136,906,0001,145,0002,117,632stderr