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 15:04highload-churnerhighload-churnerScore: 3,193Success
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 15:053,18135,362,46226,410,000020,480
2Oct 14, 2026 15:053,18835,428,76826,465,000020,480
3Oct 14, 2026 15:053,19335,576,06826,503,000020,480
4Oct 14, 2026 15:053,19335,420,65226,509,000020,480
5Oct 14, 2026 15:053,19335,494,93826,502,000020,480
6Oct 14, 2026 15:053,19336,024,55826,509,000020,480
7Oct 14, 2026 15:053,19636,147,42826,535,000020,480
8Oct 14, 2026 15:053,19935,691,36426,557,000020,480
9Oct 14, 2026 15:053,20336,160,92026,592,000020,480