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 9, 2026 23:45highload-churnerhighload-churnerScore: 3,299Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:303,28036,282,22027,226,000020,480
2Oct 10, 2026 01:303,28436,229,40727,258,000020,480
3Oct 10, 2026 01:303,28736,307,91227,283,000020,480
4Oct 10, 2026 01:303,29036,384,42927,315,000020,480
5Oct 10, 2026 01:303,29936,369,30926,357,0001,032,00020,480
6Oct 10, 2026 01:303,30836,461,80927,460,000020,480
7Oct 10, 2026 01:303,32436,652,19327,594,000020,480
8Oct 10, 2026 01:303,39337,221,39828,165,000020,480
9Oct 10, 2026 01:303,42937,532,19328,463,000020,480