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:22Karthik 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:220379,728,297369,506,0001,118,0002,113,536expected "53691036849195215 ", got "2716 28 999|2624,57 2625,64 2632,70 2639,77 2621,57 2625,63 2631,70 2639,77 2621,57 2623,63 2630,69 2644,78 |2531|223 "
2Oct 2, 2026 06:220379,496,477369,268,0001,154,0002,113,536expected "53687911631323672 ", got "2722 27 999|2620,57 2620,63 2627,69 2636,77 2619,56 2627,63 2635,69 2636,77 2621,57 2626,62 2628,69 2636,76 |2532|86 "
3Oct 2, 2026 06:220378,655,744368,530,0001,037,0002,113,536expected "53689374638936782 ", got "2712 26 999|2608,56 2613,63 2624,69 2629,77 2612,56 2648,63 2631,69 2628,77 2608,56 2613,63 2618,69 2631,76 |2526|51 "