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:15Karthik 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:150256,186,803245,992,0001,133,0002,113,536expected "53685985914370416 ", got "2621 2788 2792 2589 2789 2792 2591 2791 2792 "
2Oct 2, 2026 15:150256,243,438246,088,0001,106,0002,113,536expected "53684974907486151 ", got "2655 2788 2789 2578 2789 2788 2578 2790 2792 "
3Oct 2, 2026 15:150254,851,410244,664,0001,018,0002,113,536expected "53687372672163979 ", got "2603 2772 2774 2568 2772 2776 2569 2773 2796 "