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 listSep 17, 2026 16:07Andrew EpsteinAndrew EpsteinScore: 147,208Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:09146,8391,229,034,5731,217,768,0001,003,0002,117,632stderr
2Sep 17, 2026 16:09146,9161,229,584,3941,218,403,0001,004,0002,117,632stderr
3Sep 17, 2026 16:09147,0781,231,058,9621,218,748,0002,007,0002,117,632stderr
4Sep 17, 2026 16:09147,1591,231,626,7741,220,424,0001,001,0002,117,632stderr
5Sep 17, 2026 16:09147,2081,232,034,7491,220,827,0001,003,0002,117,632stderr
6Sep 17, 2026 16:09147,2241,232,208,9481,220,958,0001,002,0002,117,632stderr
7Sep 17, 2026 16:09147,3131,233,036,3511,221,692,0001,007,0002,117,632stderr
8Sep 17, 2026 16:09147,5131,234,644,1481,222,346,0002,019,0002,117,632stderr
9Sep 17, 2026 16:09147,5611,235,001,0961,223,755,0001,002,0002,117,632stderr