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 12, 2026 15:25highload-churnerhighload-churnerScore: 3,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 15:253,28736,279,03027,290,000020,480
2Oct 12, 2026 15:253,28836,472,50727,296,000020,480
3Oct 12, 2026 15:253,29536,261,50527,349,000020,480
4Oct 12, 2026 15:253,29536,338,93727,351,000020,480
5Oct 12, 2026 15:253,29936,329,20727,384,000020,480
6Oct 12, 2026 15:253,30136,383,78627,399,000020,480
7Oct 12, 2026 15:253,32236,532,43427,578,000020,480
8Oct 12, 2026 15:253,32636,691,69427,613,000020,480
9Oct 12, 2026 15:253,36936,935,95827,970,000020,480