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:41Karthik 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:410699,127,104688,735,0001,012,0002,113,536expected "53681889167936511 ", got "2712 27 999|2654 2660 2660 2629 2655 2638 2629 2628 2648 2658 2649 2699 2628 2631 2637 2634 2632 2639 2625 2623 2631 2636 2639 2654 |2527|144 "
2Oct 1, 2026 15:410699,285,605689,174,0001,099,0002,113,536expected "53681420083846201 ", got "2691 27 999|2655 2666 2654 2637 2647 2637 2631 2637 2670 2661 2659 2666 2630 2649 2638 2632 2639 2641 2625 2632 2635 2634 2645 2644 |2532|134 "
3Oct 1, 2026 15:410695,727,012685,601,0001,122,0002,113,536expected "53693383841258775 ", got "2678 26 999|2641 2654 2647 2618 2634 2630 2612 2629 2621 2645 2646 2652 2613 2644 2625 2615 2629 2628 2612 2623 2624 2620 2633 2631 |2529|181 "