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:530379,918,426369,896,0001,022,0002,113,536expected "53678260490723058 ", got "2723 28 999|2619,53 2623,53 2628,65 2618,52 2620,52 2620,54 2625,53 2623,54 2635,65 2668,53 2636,53 2628,54 |2566|254 "
2Oct 2, 2026 05:530377,847,699367,765,0001,002,0002,113,536expected "53693991265296549 ", got "2701 27 999|2611,54 2615,54 2620,66 2614,53 2612,54 2615,55 2612,54 2615,54 2634,66 2619,53 2611,54 2613,55 |2527|60 "
3Oct 2, 2026 05:530377,916,098367,640,0001,109,0002,113,536expected "53691870774343479 ", got "2705 27 999|2611,52 2614,51 2619,63 2610,50 2611,51 2629,52 2614,51 2616,51 2618,63 2612,51 2611,52 2613,52 |2532|69 "