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 14, 2026 13:10highload-churnerhighload-churnerScore: 3,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 13:113,23136,391,02626,818,000020,480
2Oct 14, 2026 13:113,24135,888,71426,906,000020,480
3Oct 14, 2026 13:113,24535,890,94726,938,000020,480
4Oct 14, 2026 13:113,24636,478,42326,946,000020,480
5Oct 14, 2026 13:113,25237,398,12426,999,000020,480
6Oct 14, 2026 13:113,25435,942,95127,009,000020,480
7Oct 14, 2026 13:113,26036,050,10127,062,000020,480
8Oct 14, 2026 13:113,26236,057,09527,075,000020,480
9Oct 14, 2026 13:113,29136,312,18827,319,000020,480