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:12Karthik 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:120244,626,953234,535,0001,135,0002,113,536expected "53685786927316369 ", got "2594 2574 2654 2563 2574 2653 2563 2574 2654 "
2Oct 2, 2026 15:120247,287,607237,173,0001,112,0002,113,536expected "53686799894729262 ", got "2606 2600 2695 2584 2600 2695 2586 2601 2693 "
3Oct 2, 2026 15:120245,805,332235,741,0001,091,0002,113,536expected "53686219366643474 ", got "2600 2587 2668 2576 2587 2667 2576 2588 2667 "