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 listAug 27, 2026 17:35Victor MerckléVictor MerckléScore: 3,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:363,71739,909,07529,690,0001,165,0002,113,536
2Aug 27, 2026 17:363,71839,343,71429,703,0001,158,0002,113,536
3Aug 27, 2026 17:363,72040,016,20229,728,0001,152,0002,113,536
4Aug 27, 2026 17:363,73039,331,00329,864,0001,102,0002,113,536
5Aug 27, 2026 17:363,73839,365,83229,957,0001,073,0002,113,536
6Aug 27, 2026 17:363,73939,326,44129,953,0001,081,0002,113,536
7Aug 27, 2026 17:363,81546,807,37930,566,0001,101,0002,113,536
8Aug 27, 2026 17:363,87740,599,68831,104,0001,082,0002,113,536
9Aug 27, 2026 17:363,91640,902,72131,418,0001,092,0002,113,536