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:45highload-churnerhighload-churnerScore: 3,273Success
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:463,25735,830,38527,035,000020,480
2Oct 14, 2026 11:463,25736,023,36927,039,000020,480
3Oct 14, 2026 11:463,26536,096,26427,100,000020,480
4Oct 14, 2026 11:463,26536,226,35527,107,000020,480
5Oct 14, 2026 11:463,27336,726,46627,169,000020,480
6Oct 14, 2026 11:463,27736,750,53627,207,000020,480
7Oct 14, 2026 11:463,27936,178,21527,219,000020,480
8Oct 14, 2026 11:463,28036,235,03727,230,000020,480
9Oct 14, 2026 11:463,29636,312,54227,362,000020,480