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 11:54highload-churnerhighload-churnerScore: 20,263Success
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 11:5420,181176,524,954167,505,000024,576stderr
2Oct 14, 2026 11:5420,183176,781,007167,523,000024,576stderr
3Oct 14, 2026 11:5420,225183,905,061167,869,000024,576stderr
4Oct 14, 2026 11:5420,251177,047,579168,090,000024,576stderr
5Oct 14, 2026 11:5420,263177,190,967167,181,0001,006,00024,576stderr
6Oct 14, 2026 11:5420,265177,695,745168,206,000024,576stderr
7Oct 14, 2026 11:5420,266177,290,689167,202,0001,011,00024,576stderr
8Oct 14, 2026 11:5420,268177,291,010168,226,000024,576stderr
9Oct 14, 2026 11:5420,282177,662,334168,344,000024,576stderr