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:55Karthik 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:550606,405,103596,298,0001,048,0002,113,536expected "53690164384627554 ", got "2710 28 999|2620 2688 2888 2889 2738 2651 2649 2756 2681 2669 2636 2630 2689 2732 2752 2674 2708 2738 2757 2620 |2532|95 "
2Oct 1, 2026 16:550605,124,951595,122,0001,026,0002,113,536expected "53690531775042575 ", got "2706 26 999|2614 2685 2887 2888 2738 2657 2649 2739 2669 2673 2625 2628 2674 2723 2748 2695 2695 2730 2738 2615 |2531|182 "
3Oct 1, 2026 16:550603,502,883593,277,0001,053,0002,113,536expected "53688404440955690 ", got "2721 27 999|2613 2690 2880 2883 2729 2644 2638 2701 2661 2670 2617 2616 2667 2741 2741 2668 2697 2695 2720 2612 |2526|146 "