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 listJan 30, 2026 19:40olliecrowolliecrowScore: 14,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 19:4013,783136,402,378114,395,00002,355,200
2Jan 30, 2026 19:4013,810140,389,058111,604,0003,016,0002,371,584
3Jan 30, 2026 19:4013,945139,686,172113,749,0001,995,0002,412,544
4Jan 30, 2026 19:4013,986137,594,981114,085,0002,001,0002,433,024
5Jan 30, 2026 19:4014,071148,959,152115,789,000998,0002,359,296
6Jan 30, 2026 19:4014,195143,659,120115,822,0001,996,0002,359,296
7Jan 30, 2026 19:4014,330146,622,508113,944,0004,997,0002,310,144
8Jan 30, 2026 19:4014,517146,426,053118,479,0002,008,0002,420,736
9Jan 30, 2026 19:4015,402153,582,589126,838,000998,0002,420,736