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 03:25highload-churnerhighload-churnerScore: 3,467Success
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 03:253,28636,145,44527,280,000020,480
2Oct 13, 2026 03:253,28936,119,16027,304,000020,480
3Oct 13, 2026 03:253,32936,485,63127,633,000020,480
4Oct 13, 2026 03:253,44137,326,96628,561,000020,480
5Oct 13, 2026 03:253,46737,606,65828,782,000020,480
6Oct 13, 2026 03:253,47837,672,63228,873,000020,480
7Oct 13, 2026 03:253,48538,303,39228,927,000020,480
8Oct 13, 2026 03:253,49238,406,07528,984,000020,480
9Oct 13, 2026 03:253,49338,521,01428,998,000020,480