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:47highload-churnerhighload-churnerScore: 3,249Success
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:483,23136,368,17726,823,000020,480
2Oct 14, 2026 11:483,23435,812,23826,844,000020,480
3Oct 14, 2026 11:483,24336,253,06526,919,000020,480
4Oct 14, 2026 11:483,24435,931,91526,928,000020,480
5Oct 14, 2026 11:483,24936,016,33326,969,000020,480
6Oct 14, 2026 11:483,25336,358,19327,001,000020,480
7Oct 14, 2026 11:483,25336,541,75727,007,000020,480
8Oct 14, 2026 11:483,25635,980,43727,025,000020,480
9Oct 14, 2026 11:483,25939,077,53227,053,000020,480