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 1, 2026 16:14Karthik 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 1, 2026 16:140706,973,165696,659,0001,004,0002,113,536expected "53691401889435877 ", got "2703 28 999|2625 2623 2622 2657 2626 2630 2651 2623 2613 2650 2619 2621 2799 2798 2797 2824 2801 2801 2628 2626 2627 2685 2634 2636 |2528|8 "
2Oct 1, 2026 16:140705,628,138695,438,0001,120,0002,113,536expected "53694276276150843 ", got "2707 27 999|2622 2623 2622 2641 2626 2626 2614 2615 2613 2635 2620 2618 2797 2801 2797 2812 2801 2799 2625 2628 2625 2658 2630 2632 |2531|180 "
3Oct 1, 2026 16:140709,106,644698,901,0001,121,0002,113,536expected "53684308650427008 ", got "2737 27 999|2637 2636 2634 2642 2638 2641 2630 2630 2628 2631 2630 2632 2813 2815 2815 2834 2814 2817 2644 2647 2646 2649 2648 2646 |2533|248 "