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 10:16highload-churnerhighload-churnerScore: 3,353Success
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 10:173,26735,959,91327,124,000020,480
2Oct 13, 2026 10:173,27336,214,28227,168,000020,480
3Oct 13, 2026 10:173,27636,119,05127,199,000020,480
4Oct 13, 2026 10:173,33436,535,87827,680,000020,480
5Oct 13, 2026 10:173,35336,597,67427,830,000020,480
6Oct 13, 2026 10:173,36036,797,77027,889,000020,480
7Oct 13, 2026 10:173,36636,766,10327,946,000020,480
8Oct 13, 2026 10:173,45238,166,76628,655,000020,480
9Oct 13, 2026 10:173,47537,656,54728,844,000020,480