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 13, 2026 00:40highload-churnerhighload-churnerScore: 3,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 00:413,29936,354,61827,387,000020,480
2Oct 13, 2026 00:413,30636,243,39127,440,000020,480
3Oct 13, 2026 00:413,39737,179,54228,199,000020,480
4Oct 13, 2026 00:413,43237,935,53828,489,000020,480
5Oct 13, 2026 00:413,45138,161,24628,646,000020,480
6Oct 13, 2026 00:413,46937,656,23828,796,000020,480
7Oct 13, 2026 00:413,47437,726,28428,840,000020,480
8Oct 13, 2026 00:413,49238,538,88328,987,000020,480
9Oct 13, 2026 00:413,49838,546,25529,036,000020,480