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 05:52Karthik 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 05:520380,729,770370,631,0001,007,0002,113,536expected "53686168257963704 ", got "2710 28 999|2616,51 2626,51 2636,52 2634,51 2679,50 2630,51 2624,51 2625,51 2635,52 2634,51 2686,50 2635,51 |2535|182 "
2Oct 2, 2026 05:520379,518,351369,389,0001,074,0002,113,536expected "53685645911833540 ", got "2711 27 999|2609,52 2622,51 2629,53 2626,52 2665,51 2612,52 2611,52 2630,51 2626,53 2625,52 2666,51 2634,52 |2527|210 "
3Oct 2, 2026 05:520380,475,673369,751,0001,183,0002,113,536expected "53687581959559211 ", got "2711 27 999|2615,53 2629,53 2631,54 2630,54 2668,53 2620,53 2624,54 2624,53 2631,54 2631,54 2668,53 2618,53 |2533|196 "