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:37Karthik 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:370379,830,344369,662,0001,004,0002,113,536expected "53688414905638329 ", got "2705 27 999|2628,41 2625,38 2615,54 2651,52 2629,41 2625,38 2613,54 2652,52 2628,41 2644,38 2615,55 2653,52 |2530|92 "
2Oct 2, 2026 05:370381,472,320371,272,0001,133,0002,113,536expected "53682250227806057 ", got "2721 28 999|2641,45 2642,40 2629,57 2664,53 2639,44 2642,41 2628,57 2664,54 2646,45 2641,41 2626,57 2665,53 |2532|67 "
3Oct 2, 2026 05:370380,682,652370,519,0001,125,0002,113,536expected "53690702646306138 ", got "2720 27 999|2635,40 2635,38 2625,53 2657,51 2636,41 2634,37 2622,53 2661,52 2637,40 2634,37 2622,53 2657,52 |2530|220 "