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 1, 2026 15:38Karthik 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 1, 2026 15:380501,255,796491,156,0001,066,0002,113,536expected "53695563221274651 ", got "2702 28 999|2676 2717 2691 2673 2662 2646 2678 2692 3187 3111 2662 2712 2657 2649 2658 2628 |2531|11 "
2Oct 1, 2026 15:380499,832,993489,464,0001,151,0002,113,536expected "53687233319050945 ", got "2676 27 999|2651 2650 2688 2678 2660 2653 2676 2699 3180 3127 2663 2661 2650 2649 2653 2630 |2530|31 "
3Oct 1, 2026 15:380501,109,003491,002,0001,010,0002,113,536expected "53684491023329365 ", got "2703 26 999|2687 2810 2692 2668 2673 2639 2673 2684 3182 3120 2655 2651 2650 2636 2656 2614 |2524|84 "