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 08:29highload-churnerhighload-churnerScore: 3,651Success
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 08:293,64039,259,61630,217,000024,576stderr
2Oct 13, 2026 08:293,64639,695,34230,267,000024,576stderr
3Oct 13, 2026 08:293,64639,180,49930,264,000024,576stderr
4Oct 13, 2026 08:293,64839,242,47730,282,000024,576stderr
5Oct 13, 2026 08:293,65139,403,88330,308,000024,576stderr
6Oct 13, 2026 08:293,65239,150,20430,319,000024,576stderr
7Oct 13, 2026 08:293,65538,940,35730,343,000024,576stderr
8Oct 13, 2026 08:293,66139,136,14730,389,000024,576stderr
9Oct 13, 2026 08:293,67839,357,16630,532,000024,576stderr