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 08:51highload-churnerhighload-churnerScore: 3,270Success
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 08:523,25635,995,39427,028,000020,480
2Oct 14, 2026 08:523,25936,076,96527,050,000020,480
3Oct 14, 2026 08:523,26536,053,11927,106,000020,480
4Oct 14, 2026 08:523,26736,676,03927,117,000020,480
5Oct 14, 2026 08:523,27036,144,63027,144,000020,480
6Oct 14, 2026 08:523,27136,699,98727,156,000020,480
7Oct 14, 2026 08:523,27536,363,49027,189,000020,480
8Oct 14, 2026 08:523,28136,820,10827,237,000020,480
9Oct 14, 2026 08:523,28436,268,80527,258,000020,480