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:31Karthik 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:310687,180,793677,076,0001,051,0002,113,536expected "53687738077697290 ", got "2702 28 999|2744 3241 2655 2736 3257 2647 2646 2776 2652 2818 |2654 2579 2526 2560 2702 2522 2526 2529 2521 2558 2809 2592 2840 2690|80 "
2Oct 1, 2026 15:310687,588,458677,360,0001,137,0002,113,536expected "53686720847049831 ", got "2687 26 999|2665 3252 2667 2729 3277 2649 2650 2781 2674 2807 |2655 2582 2556 2566 2700 2523 2532 2537 2527 2563 2806 2590 2844 2699|52 "
3Oct 1, 2026 15:310687,427,235677,228,0001,195,0002,113,536expected "53681868395237249 ", got "2691 26 999|2665 3245 2662 2731 3242 2656 2653 2779 2662 2805 |2664 2589 2531 2566 2708 2528 2533 2534 2529 2569 2806 2599 2853 2705|44 "