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 listFeb 10, 2026 19:54Aleksandr MedvedevAleksandr MedvedevScore: 2,068,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:542,061,40217,143,172,74917,042,665,00066,971,0002,281,472
2Feb 10, 2026 19:542,067,43917,194,655,91717,105,771,00053,974,0002,289,664
3Feb 10, 2026 19:542,067,71317,199,350,17017,073,054,00088,963,0002,289,664
4Feb 10, 2026 19:542,068,40117,202,555,70917,104,749,00062,976,0002,273,280
5Feb 10, 2026 19:542,068,70117,200,425,43217,102,246,00067,973,0002,281,472
6Feb 10, 2026 19:542,069,13417,204,532,40217,083,853,00089,962,0002,281,472
7Feb 10, 2026 19:542,069,70817,218,074,22717,105,615,00072,959,0002,293,760
8Feb 10, 2026 19:542,070,88017,225,302,77517,121,330,00066,970,0002,281,472
9Feb 10, 2026 19:542,072,30317,236,778,20417,131,146,00068,972,0002,293,760