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 09:29highload-churnerhighload-churnerScore: 37,656Success
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:2937,610321,601,211312,164,000024,576stderr
2Oct 13, 2026 09:2937,613321,625,078312,193,000024,576stderr
3Oct 13, 2026 09:2937,621321,588,637312,256,000024,576stderr
4Oct 13, 2026 09:2937,628321,188,921311,301,0001,015,00024,576stderr
5Oct 13, 2026 09:2937,656321,385,575312,546,000024,576stderr
6Oct 13, 2026 09:2937,663321,434,800312,611,000024,576stderr
7Oct 13, 2026 09:2937,679321,527,490312,743,000024,576stderr
8Oct 13, 2026 09:2937,705322,392,682312,956,000024,576stderr
9Oct 13, 2026 09:2937,736322,713,066313,209,000024,576stderr