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 20:01olliecrowolliecrowScore: 11,708Success
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 20:0111,540120,943,82492,786,0002,993,0002,289,664
2Jan 30, 2026 20:0111,544121,367,54493,819,0001,996,0002,519,040
3Jan 30, 2026 20:0111,566125,309,49294,998,000999,0002,289,664
4Jan 30, 2026 20:0111,708126,556,75495,176,0002,003,0002,293,760
5Jan 30, 2026 20:0111,716130,528,84595,240,0002,005,0002,293,760
6Jan 30, 2026 20:0111,731123,365,72495,361,0002,007,0002,510,848