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:30Karthik 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:300617,298,091607,109,0001,008,0002,113,536expected "53682234247092342 ", got "2737 28 999|2649 2630 2622 2643 2632 2631 2626 2623 2620 2621 2642 2630 2632 2630 2622 2620 2622 2643 2633 2632 2626 |2533|41 "
2Oct 1, 2026 17:300614,438,033604,228,0001,012,0002,113,536expected "53675715868106832 ", got "2700 27 999|2610 2607 2609 2631 2617 2619 2648 2608 2608 2607 2630 2621 2618 2636 2607 2607 2607 2630 2619 2617 2634 |2524|210 "
3Oct 1, 2026 17:300616,073,434605,873,0001,105,0002,113,536expected "53694789755527844 ", got "2700 26 999|2621 2619 2617 2641 2628 2630 2631 2617 2619 2618 2642 2627 2629 2632 2618 2618 2616 2640 2629 2628 2629 |2531|240 "