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 15:25highload-churnerhighload-churnerScore: 21,740Success
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 15:2621,663189,213,596179,808,000024,576stderr
2Oct 14, 2026 15:2621,713189,205,923180,222,000024,576stderr
3Oct 14, 2026 15:2621,733189,396,811180,387,000024,576stderr
4Oct 14, 2026 15:2621,740189,837,760180,446,000024,576stderr
5Oct 14, 2026 15:2621,740189,412,965180,445,000024,576stderr
6Oct 14, 2026 15:2621,753190,501,050180,552,000024,576stderr
7Oct 14, 2026 15:2621,787189,832,036180,839,000024,576stderr
8Oct 14, 2026 15:2621,815190,636,579181,071,000024,576stderr
9Oct 14, 2026 15:2621,836190,732,934180,218,0001,028,00024,576stderr