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 16:54Karthik 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 16:540356,060,951340,402,0006,466,0002,117,632expected "53689380084145731 ", got "409|2808 2752 2990 2735 2734 2989 2736 2733 3003 2741 2734 2995 |226 "
2Oct 2, 2026 16:540356,809,882340,990,0006,625,00020,480expected "53678112813229908 ", got "430|2808 2757 2995 2760 2739 2997 2739 2739 2995 2738 2738 2997 |217 "
3Oct 2, 2026 16:540356,475,128341,052,0006,306,00020,480expected "53691495868800438 ", got "413|2766 2740 3003 2742 2741 3003 2743 2741 3004 2768 2740 3004 |224 "