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 13:47highload-churnerhighload-churnerScore: 22,036Success
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 13:4821,950191,179,011182,190,000024,576stderr
2Oct 14, 2026 13:4821,994192,059,345182,556,000024,576stderr
3Oct 14, 2026 13:4822,014192,233,568182,717,000024,576stderr
4Oct 14, 2026 13:4822,019192,124,774182,759,000024,576stderr
5Oct 14, 2026 13:4822,036191,884,882182,902,000024,576stderr
6Oct 14, 2026 13:4822,069192,607,089183,180,000024,576stderr
7Oct 14, 2026 13:4822,093192,528,549183,375,000024,576stderr
8Oct 14, 2026 13:4822,123192,578,845183,621,000024,576stderr
9Oct 14, 2026 13:4822,134196,354,450183,714,000024,576stderr