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:02Karthik 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:050549,404,456539,230,0001,062,0002,113,536expected "53685041555838677 ", got "2878 50 999|2865 2829 2785 2850 2822 2870 2829 2817 2782 2814 2825 2868 2780 2811 2786 2774 2851 2872 | "
2Oct 1, 2026 16:050547,757,993537,495,0001,139,0002,113,536expected "53683606423321344 ", got "2872 49 999|2857 2821 2777 2833 2810 2866 2816 2810 2770 2813 2815 2859 2776 2804 2774 2766 2844 2866 | "
3Oct 1, 2026 16:050550,710,416540,507,0001,073,0002,113,536expected "53685566247083421 ", got "2877 50 999|2866 2843 2796 2850 2823 2886 2824 2831 2786 2814 2835 2879 2782 2827 2794 2778 2858 2885 | "