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: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 17:310537,555,971527,365,0001,034,0002,113,536expected "53686379856152448 ", got "2708 28 999|2620 2622 2622 2627 2634 2641 2621 2623 2622 2629 2635 2653 2620 2622 2622 2629 2634 2643 |2525|20 "
2Oct 1, 2026 17:310537,317,382526,980,0001,186,0002,113,536expected "53685370814878269 ", got "2707 27 999|2619 2620 2622 2628 2633 2636 2619 2621 2623 2627 2634 2637 2618 2631 2618 2629 2632 2637 |2531|57 "
3Oct 1, 2026 17:310538,473,641528,241,0001,119,0002,113,536expected "53678636817092594 ", got "2707 28 999|2626 2627 2628 2635 2640 2645 2625 2626 2629 2636 2640 2645 2628 2628 2628 2633 2639 2646 |2530|170 "