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:09highload-churnerhighload-churnerScore: 3,459Success
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:123,35336,733,15127,833,000020,480
2Oct 14, 2026 11:123,40937,171,34828,301,000020,480
3Oct 14, 2026 11:123,44838,133,43728,621,000020,480
4Oct 14, 2026 11:123,45537,564,68228,681,000020,480
5Oct 14, 2026 11:123,45937,586,58828,710,000020,480
6Oct 14, 2026 11:123,46237,598,06228,738,000020,480
7Oct 14, 2026 11:123,46638,198,76728,772,000020,480
8Oct 14, 2026 11:123,47637,670,42228,854,000020,480
9Oct 14, 2026 11:123,50940,166,08329,126,000020,480