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 14, 2026 15:47Juraj ZelmanJuraj ZelmanScore: 11,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 15:4711,040114,566,14991,629,00002,293,760
2Feb 14, 2026 15:4711,051124,220,30991,721,00002,367,488
3Feb 14, 2026 15:4711,059120,856,41589,794,0001,995,0002,293,760
4Feb 14, 2026 15:4711,156121,756,44792,597,00002,285,568
5Feb 14, 2026 15:4711,165121,949,71291,664,0001,007,0002,285,568
6Feb 14, 2026 15:4711,178125,199,05092,779,00002,285,568