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 listJul 23, 2026 16:03Kasper KivimäkiKasper KivimäkiScore: 58,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:0358,308493,688,393482,816,0001,143,0002,113,536
2Jul 23, 2026 16:0358,346494,058,973483,134,0001,140,0002,113,536
3Jul 23, 2026 16:0358,375494,221,086483,471,0001,048,0002,113,536
4Jul 23, 2026 16:0358,385494,946,881483,489,0001,109,0002,113,536
5Jul 23, 2026 16:0358,420494,880,346483,787,0001,105,0002,113,536
6Jul 23, 2026 16:0358,433494,667,367483,933,0001,065,0002,113,536
7Jul 23, 2026 16:0358,437495,405,766483,936,0001,098,0002,113,536
8Jul 23, 2026 16:0358,462494,970,932484,234,0001,006,0002,113,536
9Jul 23, 2026 16:0358,525496,178,228484,755,0001,003,0002,113,536