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 2, 2026 11:23Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 11:230245,715,338235,508,0001,133,0002,113,536expected "53696074267227166 ", got "2642 2596 2611 2615 2598 2609 2615 2597 2611 "
2Oct 2, 2026 11:230246,211,266236,031,0001,050,0002,113,536expected "53685699675678693 ", got "2643 2605 2613 2618 2602 2612 2632 2605 2611 "
3Oct 2, 2026 11:230244,826,501234,829,0001,001,0002,113,536expected "53685874385986614 ", got "2631 2591 2600 2606 2588 2598 2605 2588 2598 "