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:32Karthik 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:320616,439,171606,243,0001,113,0002,113,536expected "53681987374982880 ", got "2732 27 999|2626 2626 2628 2626 2626 2627 2629 2625 2628 2626 2627 2629 2625 2626 2624 2627 2629 2626 2625 2625 2626 |2533|186 "
2Oct 1, 2026 17:320616,450,218606,329,0001,114,0002,113,536expected "53685198383676490 ", got "2709 27 999|2625 2630 2628 2627 2627 2627 2628 2629 2628 2631 2628 2629 2627 2628 2625 2628 2631 2628 2628 2626 2627 |2534|168 "
3Oct 1, 2026 17:320614,977,940604,766,0001,032,0002,113,536expected "53682775382850496 ", got "2704 26 999|2617 2622 2619 2620 2620 2617 2620 2619 2632 2623 2621 2620 2634 2621 2619 2620 2619 2620 2617 2618 2620 |2527|242 "