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 listSep 6, 2026 02:27CheckHarryCheckHarryScore: 4,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 02:274,35345,998,75934,915,0001,221,0002,113,536
2Sep 6, 2026 02:274,35746,020,25434,949,0001,215,0002,113,536
3Sep 6, 2026 02:274,35846,113,51334,952,0001,226,0002,113,536
4Sep 6, 2026 02:274,37047,316,81835,039,0001,234,0002,113,536
5Sep 6, 2026 02:274,37146,347,70535,047,0001,234,0002,113,536
6Sep 6, 2026 02:274,38446,272,23535,160,0001,229,0002,113,536
7Sep 6, 2026 02:274,38957,081,98035,164,0001,271,0002,113,536
8Sep 6, 2026 02:274,39246,306,79635,244,0001,211,0002,113,536
9Sep 6, 2026 02:274,48047,088,10535,950,0001,235,0002,113,536