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:19highload-churnerhighload-churnerScore: 3,458Success
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:203,27035,955,59627,142,000020,480
2Oct 13, 2026 10:203,39637,045,97028,195,000020,480
3Oct 13, 2026 10:203,43737,382,12628,529,000020,480
4Oct 13, 2026 10:203,44037,371,05328,554,000020,480
5Oct 13, 2026 10:203,45837,540,17128,702,000020,480
6Oct 13, 2026 10:203,46137,572,40328,733,000020,480
7Oct 13, 2026 10:203,46137,563,53528,727,000020,480
8Oct 13, 2026 10:203,46137,698,44828,728,000020,480
9Oct 13, 2026 10:203,49738,441,94229,032,000020,480