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 02:45highload-churnerhighload-churnerScore: 3,473Success
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 02:463,33536,506,30627,682,000020,480
2Oct 13, 2026 02:463,40337,053,81128,253,000020,480
3Oct 13, 2026 02:463,46438,227,40628,753,000020,480
4Oct 13, 2026 02:463,46737,618,80428,783,000020,480
5Oct 13, 2026 02:463,47337,617,44528,833,000020,480
6Oct 13, 2026 02:463,48137,958,52128,896,000020,480
7Oct 13, 2026 02:463,49637,880,86829,019,000020,480
8Oct 13, 2026 02:463,50038,455,61129,055,000020,480
9Oct 13, 2026 02:463,50738,592,05229,110,000020,480