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 06:40highload-churnerhighload-churnerScore: 3,310Success
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 06:403,28336,082,47627,251,000020,480
2Oct 13, 2026 06:403,29036,099,74527,312,000020,480
3Oct 13, 2026 06:403,29136,158,58327,322,000020,480
4Oct 13, 2026 06:403,30336,306,22127,422,000020,480
5Oct 13, 2026 06:403,31036,354,32627,475,000020,480
6Oct 13, 2026 06:403,40837,122,65328,293,000020,480
7Oct 13, 2026 06:403,45838,175,00128,702,000020,480
8Oct 13, 2026 06:403,47337,692,48328,828,000020,480
9Oct 13, 2026 06:403,48038,356,63528,888,000020,480