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 listDec 15, 2025 15:18AndreiAndreiScore: 58,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 15:1858,521513,339,138483,727,0001,998,0002,293,760
2Dec 15, 2025 15:1858,525513,395,098483,760,0001,999,0002,535,424
3Dec 15, 2025 15:1858,527515,015,116483,773,0001,999,0002,404,352
4Dec 15, 2025 15:1858,540513,470,771484,883,000999,0002,523,136
5Dec 15, 2025 15:1858,550508,319,763484,964,000999,0002,539,520
6Dec 15, 2025 15:1858,558517,371,152485,030,0001,000,0002,555,904
7Dec 15, 2025 15:1858,630518,527,743484,635,0001,998,0002,293,760
8Dec 15, 2025 15:1858,633516,529,000483,661,0002,997,0002,551,808
9Dec 15, 2025 15:1858,645513,826,573483,754,0002,998,0002,551,808