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:49Karthik 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:490219,297,852209,131,0001,097,0002,113,536expected "53693412606923915 ", got "2580 2647 2563 2648 2563 2646 2563 2646 "
2Oct 2, 2026 15:490221,194,082211,015,0001,111,0002,113,536expected "53683729237676967 ", got "2606 2658 2591 2654 2625 2657 2596 2657 "
3Oct 2, 2026 15:490220,031,150209,849,0001,114,0002,113,536expected "53697222400867031 ", got "2592 2652 2574 2653 2577 2654 2574 2652 "