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 10:40highload-churnerhighload-churnerScore: 3,430Success
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 10:413,31036,413,17427,474,000020,480
2Oct 13, 2026 10:413,33436,471,55527,680,000020,480
3Oct 13, 2026 10:413,38236,895,77328,072,000020,480
4Oct 13, 2026 10:413,41837,732,20628,370,000020,480
5Oct 13, 2026 10:413,43037,283,33828,473,000020,480
6Oct 13, 2026 10:413,46638,255,90628,772,000020,480
7Oct 13, 2026 10:413,47738,486,30328,864,000020,480
8Oct 13, 2026 10:413,48038,399,59128,892,000020,480
9Oct 13, 2026 10:413,49037,846,92328,975,000020,480