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 08:20highload-churnerhighload-churnerScore: 13,062Success
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 08:2112,917116,230,669107,212,000024,576stderr
2Oct 14, 2026 08:2112,919116,188,998107,229,000024,576stderr
3Oct 14, 2026 08:2113,044117,426,185108,270,000024,576stderr
4Oct 14, 2026 08:2113,053117,900,700108,347,000024,576stderr
5Oct 14, 2026 08:2113,062117,361,598107,409,0001,006,00024,576stderr
6Oct 14, 2026 08:2113,064117,523,775108,435,000024,576stderr
7Oct 14, 2026 08:2113,067117,329,733108,461,000024,576stderr
8Oct 14, 2026 08:2113,105118,219,997108,777,000024,576stderr
9Oct 14, 2026 08:2113,138118,522,017109,048,000024,576stderr