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:58Aleksandr MedvedevAleksandr MedvedevScore: 2,068,564Success
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:582,066,94517,190,850,61417,111,668,00043,978,0002,281,472
2Feb 10, 2026 19:582,067,37317,187,489,86817,100,219,00058,976,0002,281,472
3Feb 10, 2026 19:582,067,70217,193,910,44017,095,955,00065,968,0002,281,472
4Feb 10, 2026 19:582,068,37317,195,031,58417,106,521,00060,973,0002,281,472
5Feb 10, 2026 19:582,068,56417,207,366,43417,099,111,00069,967,0002,281,472
6Feb 10, 2026 19:582,070,57717,215,204,94317,120,815,00064,972,0002,281,472
7Feb 10, 2026 19:582,079,63117,302,788,64317,207,957,00052,978,0002,281,472
8Feb 10, 2026 19:582,092,99717,410,519,06517,293,903,00077,968,0002,281,472
9Feb 10, 2026 19:582,153,19017,906,476,54917,785,518,00085,959,0002,289,664