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 02:51highload-churnerhighload-churnerScore: 3,311Success
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 02:513,27736,019,61327,201,000020,480
2Oct 13, 2026 02:513,28936,127,39327,305,000020,480
3Oct 13, 2026 02:513,29236,876,61827,328,000020,480
4Oct 13, 2026 02:513,30236,188,16527,413,000020,480
5Oct 13, 2026 02:513,31136,346,90326,484,0001,003,00020,480
6Oct 13, 2026 02:513,43237,358,07528,489,000020,480
7Oct 13, 2026 02:513,45438,317,11628,669,000020,480
8Oct 13, 2026 02:513,51338,035,61529,166,000020,480
9Oct 13, 2026 02:513,56539,098,23429,593,000020,480