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 listJan 3, 2026 02:58Josu San MartinJosu San MartinScore: 5,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:585,52073,382,28944,818,000995,0002,281,472
2Jan 3, 2026 02:585,68874,244,44046,203,0001,004,0002,265,088
3Jan 3, 2026 02:585,78272,415,89046,995,000999,0002,289,664
4Jan 3, 2026 02:585,84774,388,79648,527,00002,367,488
5Jan 3, 2026 02:585,93872,969,50547,271,0002,011,0002,359,296
6Jan 3, 2026 02:586,00380,854,36748,826,000996,0002,293,760