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 2, 2026 06:57Karthik 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 2, 2026 06:570381,016,515370,885,0001,016,0002,113,536expected "53684340088551795 ", got "2722 28 999|2596,53 2635,79 2716,131 2596,53 2596,53 2636,79 2718,132 2596,53 2597,53 2638,79 2717,132 2597,53 |2534|27 "
2Oct 2, 2026 06:570380,332,617370,203,0001,046,0002,113,536expected "53686088997619231 ", got "2708 27 999|2598,52 2631,78 2710,133 2594,53 2594,52 2629,79 2709,132 2594,53 2606,52 2629,79 2709,133 2595,52 |2526|203 "
3Oct 2, 2026 06:570380,967,102370,799,0001,162,0002,113,536expected "53685321994783787 ", got "2717 26 999|2597,52 2635,78 2721,132 2596,53 2596,53 2637,80 2722,133 2596,53 2595,53 2634,79 2723,134 2598,53 |2532|2 "