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:25Victor MerckléVictor MerckléScore: 45,956Success
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:2745,913389,172,636380,001,0001,084,0002,117,632stderr
2Jul 7, 2026 05:2745,927389,294,202380,176,0001,023,0002,117,632stderr
3Jul 7, 2026 05:2745,943389,980,732380,175,0001,154,0002,117,632stderr
4Jul 7, 2026 05:2745,952389,645,047380,240,0001,167,0002,117,632stderr
5Jul 7, 2026 05:2745,956389,666,001380,345,0001,095,0002,117,632stderr
6Jul 7, 2026 05:2746,002389,966,275380,817,0001,004,0002,117,632stderr
7Jul 7, 2026 05:2746,044390,330,726381,015,0001,152,0002,117,632stderr
8Jul 7, 2026 05:2746,383393,115,809383,981,0001,004,0002,117,632stderr
9Jul 7, 2026 05:2746,563394,670,848385,474,0001,003,0002,117,632stderr