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 13, 2026 00:51highload-churnerhighload-churnerScore: 3,482Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 00:523,30036,099,22727,391,000020,480
2Oct 13, 2026 00:523,35336,728,19127,831,000020,480
3Oct 13, 2026 00:523,44639,040,54228,603,000020,480
4Oct 13, 2026 00:523,48138,404,23728,898,000020,480
5Oct 13, 2026 00:523,48238,403,05128,906,000020,480
6Oct 13, 2026 00:523,49537,778,07029,013,000020,480
7Oct 13, 2026 00:523,49737,975,96129,028,000020,480
8Oct 13, 2026 00:523,51338,650,45229,158,000020,480
9Oct 13, 2026 00:523,52338,763,75929,242,000020,480