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 15:51Karthik 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 15:510252,705,199242,517,0001,105,0002,113,536expected "53684169239254556 ", got "2591 2657 2824 2575 2659 2824 2574 2658 2826 "
2Oct 2, 2026 15:510253,156,330243,025,0001,115,0002,113,536expected "53684382680188069 ", got "2596 2667 2827 2578 2668 2827 2580 2669 2827 "
3Oct 2, 2026 15:510253,204,596243,136,0001,029,0002,113,536expected "53689688908612549 ", got "2584 2663 2827 2565 2662 2853 2592 2669 2829 "