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 14, 2026 11:51highload-churnerhighload-churnerScore: 28,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 11:5128,356244,336,090235,359,000024,576stderr
2Oct 14, 2026 11:5128,396245,190,146235,691,000024,576stderr
3Oct 14, 2026 11:5128,402251,374,815234,643,0001,094,00024,576stderr
4Oct 14, 2026 11:5128,425245,417,470234,832,0001,097,00024,576stderr
5Oct 14, 2026 11:5128,468245,206,917236,285,000024,576stderr
6Oct 14, 2026 11:5128,482245,380,721235,394,0001,008,00024,576stderr
7Oct 14, 2026 11:5128,501246,027,032235,522,0001,044,00024,576stderr
8Oct 14, 2026 11:5128,568246,009,641236,108,0001,007,00024,576stderr
9Oct 14, 2026 11:5128,569246,177,991237,126,000024,576stderr