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 15:25Karthik 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 15:250892,932,754882,767,0001,009,0002,113,536expected "53683247803591134 ", got "2674 27 999|2645 2836 2818 2878 2773 2681 2851 2671 2793 2763 2699 2777 |2690 2950 2932 2992 2849 2710 2900 2587 2750 2526 2612 2684 3008 2589 2678 2625 2658 2644 2763|154 "
2Oct 1, 2026 15:250894,538,645884,370,0001,120,0002,113,536expected "53693420697939899 ", got "2677 27 999|2661 2839 2823 2885 2779 2671 2834 2680 2803 2739 2709 2790 |2699 2949 2936 2990 2851 2714 2901 2595 2759 2534 2616 2689 3011 2600 2707 2643 2670 2658 2760|136 "
3Oct 1, 2026 15:250894,905,689884,742,0001,032,0002,113,536expected "53684623473960160 ", got "2687 28 999|2671 2836 2826 2881 2774 2693 2853 2685 2797 2753 2708 2791 |2701 2953 2932 2987 2858 2717 2904 2602 2758 2531 2612 2687 3014 2594 2689 2632 2662 2650 2762|148 "