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 listMar 21, 2026 08:58olliecrowolliecrowScore: 6,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 08:585,81278,602,90142,210,0006,030,0002,342,912
2Mar 21, 2026 08:585,89478,271,65143,932,0004,992,0002,355,200
3Mar 21, 2026 08:585,92574,953,75544,157,0005,017,0002,347,008
4Mar 21, 2026 08:586,00575,590,29445,853,0003,987,0002,330,624
5Mar 21, 2026 08:586,02178,752,59043,981,0005,997,0002,322,432
6Mar 21, 2026 08:586,03572,629,35947,086,0003,005,0002,367,488