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 listOct 10, 2026 00:26highload-churnerhighload-churnerScore: 3,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:553,28036,106,91127,227,000020,480
2Oct 10, 2026 01:553,36136,846,87327,899,000020,480
3Oct 10, 2026 01:553,43037,946,46328,472,000020,480
4Oct 10, 2026 01:553,45138,135,73228,650,000020,480
5Oct 10, 2026 01:553,45537,511,21328,684,000020,480
6Oct 10, 2026 01:553,45937,591,50428,715,000020,480
7Oct 10, 2026 01:553,46438,235,71528,753,000020,480
8Oct 10, 2026 01:553,47438,465,51928,838,000020,480
9Oct 10, 2026 01:553,48838,471,49928,951,000020,480