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 13, 2026 08:59highload-churnerhighload-churnerScore: 6,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 13, 2026 09:006,44662,257,56053,505,000024,576stderr
2Oct 13, 2026 09:006,45162,393,36353,549,000024,576stderr
3Oct 13, 2026 09:006,46062,413,65453,620,000024,576stderr
4Oct 13, 2026 09:006,46463,064,53853,655,000024,576stderr
5Oct 13, 2026 09:006,46862,559,78653,686,000024,576stderr
6Oct 13, 2026 09:006,46962,745,55753,698,000024,576stderr
7Oct 13, 2026 09:006,46962,578,10252,693,0001,003,00024,576stderr
8Oct 13, 2026 09:006,47162,618,22753,711,000024,576stderr
9Oct 13, 2026 09:006,47263,251,50353,720,000024,576stderr