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 18, 2026 12:37Kevin HeaveyKevin HeaveyScore: 3,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:013,61439,707,91528,766,0001,234,0002,117,632
2Jul 18, 2026 13:013,62639,789,29329,041,0001,055,0002,117,632
3Jul 18, 2026 13:013,62939,846,02228,901,0001,227,0002,117,632
4Jul 18, 2026 13:013,65239,994,56229,273,0001,041,0002,117,632
5Jul 18, 2026 13:013,66140,149,60729,350,0001,043,0002,117,632
6Jul 18, 2026 13:013,71440,544,26329,603,0001,226,0002,117,632
7Jul 18, 2026 13:013,73240,735,71229,745,0001,234,0002,117,632
8Jul 18, 2026 13:013,83241,420,95830,590,0001,218,0002,117,632
9Jul 18, 2026 13:013,84641,597,40130,709,0001,217,0002,117,632