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 05:46highload-churnerhighload-churnerScore: 23,199Success
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 05:4723,086202,026,328191,615,000024,576stderr
2Oct 14, 2026 05:4723,130200,812,116191,980,000024,576stderr
3Oct 14, 2026 05:4723,131200,924,575191,994,000024,576stderr
4Oct 14, 2026 05:4723,155201,047,919192,193,000024,576stderr
5Oct 14, 2026 05:4723,199201,470,526192,557,000024,576stderr
6Oct 14, 2026 05:4723,215202,133,433192,689,000024,576stderr
7Oct 14, 2026 05:4723,216201,545,086192,695,000024,576stderr
8Oct 14, 2026 05:4723,294202,200,842193,343,000024,576stderr
9Oct 14, 2026 05:4723,344202,666,569193,758,000024,576stderr