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 18: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 18:540305,946,186293,097,0003,734,00020,480expected "53689686873131422 ", got "2622 4699 2605 4696 2606 4698 2608 4698 "
2Oct 2, 2026 18:540304,641,917291,798,0003,744,00020,480expected "53689617067199134 ", got "2613 4673 2603 4676 2596 4674 2596 4677 "
3Oct 2, 2026 18:540307,515,158294,663,0003,828,00020,480expected "53688251184063275 ", got "2611 4749 2594 4750 2595 4746 2595 4746 "