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 25, 2026 20:32Maya RebholzMaya RebholzScore: 5,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:325,92160,870,10643,732,0005,414,0002,117,632
2May 25, 2026 20:325,94759,559,92643,678,0005,690,0002,113,536
3May 25, 2026 20:325,95061,049,68243,716,0005,677,0002,117,632
4May 25, 2026 20:325,98561,184,07144,122,0005,557,0002,117,632
5May 25, 2026 20:325,99359,194,70644,312,0005,436,0002,117,632
6May 25, 2026 20:326,00859,460,17944,386,0005,483,0002,117,632
7May 25, 2026 20:326,01061,367,83544,497,0005,389,0002,117,632
8May 25, 2026 20:326,04061,750,56544,803,0005,334,0002,113,536
9May 25, 2026 20:326,07661,133,76544,864,0005,569,0002,113,536