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 22:11highload-churnerhighload-churnerScore: 3,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 23:163,28636,191,14327,281,000020,480
2Oct 9, 2026 23:163,47137,632,16328,816,000020,480
3Oct 9, 2026 23:163,47338,330,12528,830,000020,480
4Oct 9, 2026 23:163,49338,604,41828,998,000020,480
5Oct 9, 2026 23:163,49638,538,59429,020,000020,480
6Oct 9, 2026 23:163,51238,690,53228,122,0001,031,00020,480
7Oct 9, 2026 23:163,51738,756,86629,199,000020,480
8Oct 9, 2026 23:163,52438,687,75029,253,000020,480
9Oct 9, 2026 23:163,54538,296,59329,428,000020,480