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 14:50Karthik 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 14:500243,801,025233,695,0001,103,0002,113,536expected "53685551322479759 ", got "2616 2572 2615 2565 2572 2615 2566 2573 2616 "
2Oct 2, 2026 14:500244,102,223233,760,0001,109,0002,113,536expected "53689098232652467 ", got "2598 2576 2619 2569 2575 2618 2570 2577 2618 "
3Oct 2, 2026 14:500244,755,415233,872,0001,086,0002,113,536expected "53684290041194661 ", got "2589 2581 2622 2568 2578 2623 2566 2578 2623 "