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 17:33Karthik 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 17:330695,649,860685,319,0001,180,0002,113,536expected "53683183439944664 ", got "2696 28 999|2614 2640 2641 2617 2614 2645 2641 2616 2615 2640 2641 2619 2629 2646 2640 2614 2613 2641 2642 2619 2615 2646 2639 2615 |2527|228 "
2Oct 1, 2026 17:330697,972,533687,725,0001,173,0002,113,536expected "53686664459646319 ", got "2701 26 999|2626 2646 2651 2625 2623 2656 2648 2624 2627 2649 2650 2628 2623 2655 2648 2626 2624 2648 2654 2628 2623 2656 2650 2626 |2541|132 "
3Oct 1, 2026 17:330699,176,775688,869,0001,168,0002,113,536expected "53686637725202479 ", got "2734 27 999|2713 2648 2650 2629 2622 2653 2650 2621 2622 2647 2650 2635 2622 2653 2648 2623 2622 2646 2653 2639 2623 2656 2650 2625 |2534|186 "