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:51highload-churnerhighload-churnerScore: 28,291Success
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:5128,229243,121,249234,303,000024,576stderr
2Oct 14, 2026 05:5128,257243,322,821234,534,000024,576stderr
3Oct 14, 2026 05:5128,260243,582,673234,564,000024,576stderr
4Oct 14, 2026 05:5128,274243,996,069234,676,000024,576stderr
5Oct 14, 2026 05:5128,291244,182,190234,819,000024,576stderr
6Oct 14, 2026 05:5128,306243,880,211234,941,000024,576stderr
7Oct 14, 2026 05:5128,315244,437,223235,021,000024,576stderr
8Oct 14, 2026 05:5128,373244,821,500235,504,000024,576stderr
9Oct 14, 2026 05:5128,391245,041,982234,614,0001,034,00024,576stderr