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 8, 2026 05:59Karthik 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 8, 2026 06:0003,370,635,630360,224,0001,042,0002,113,536expected "53684433271626975 ", got " base 25813=53684433271626975 pf0 33454=53684433271626975 pf0ph2 34857=53684433271626975 pd448 25666=53684433271626975 base 25646 pf0 33454 pf0ph2 34900 pd448 25671 base 25835 pf0 33420 pf0ph2 34870 pd448 25682 "
2Oct 8, 2026 06:0003,371,023,945360,845,0001,126,0002,113,536expected "53693652904722519 ", got " base 26013=53693652904722519 pf0 33629=53693652904722519 pf0ph2 34710=53693652904722519 pd448 25808=53693652904722519 base 25810 pf0 33588 pf0ph2 34696 pd448 25813 base 25804 pf0 33573 pf0ph2 34656 pd448 25827 "
3Oct 8, 2026 06:0003,371,100,199360,788,0001,088,0002,113,536expected "53681983650219456 ", got " base 25846=53681983650219456 pf0 33469=53681983650219456 pf0ph2 34991=53681983650219456 pd448 25768=53681983650219456 base 25699 pf0 33442 pf0ph2 35065 pd448 25710 base 25723 pf0 33439 pf0ph2 35013 pd448 25699 "