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 11:46highload-churnerhighload-churnerScore: 3,275Success
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 11:473,26936,053,20927,140,000020,480
2Oct 14, 2026 11:473,26936,092,68127,137,000020,480
3Oct 14, 2026 11:473,27036,100,22927,147,000020,480
4Oct 14, 2026 11:473,27236,713,28927,163,000020,480
5Oct 14, 2026 11:473,27536,780,54527,188,000020,480
6Oct 14, 2026 11:473,28036,131,94727,227,000020,480
7Oct 14, 2026 11:473,28136,804,51827,234,000020,480
8Oct 14, 2026 11:473,28636,261,81427,274,000020,480
9Oct 14, 2026 11:473,29036,256,18627,312,000020,480