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 13:50Andrew EpsteinAndrew EpsteinScore: 9,855Success
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 14:179,77489,962,10980,056,0001,074,0002,117,632stderr
2Sep 17, 2026 14:179,81790,249,16780,425,0001,061,0002,117,632stderr
3Sep 17, 2026 14:179,82090,290,29480,441,0001,072,0002,117,632stderr
4Sep 17, 2026 14:179,82990,287,26580,498,0001,084,0002,117,632stderr
5Sep 17, 2026 14:179,85590,563,69180,732,0001,069,0002,117,632stderr
6Sep 17, 2026 14:179,88790,817,91580,996,0001,067,0002,117,632stderr
7Sep 17, 2026 14:179,90390,982,58981,118,0001,083,0002,117,632stderr
8Sep 17, 2026 14:179,96591,414,96081,660,0001,056,0002,117,632stderr
9Sep 17, 2026 14:1710,00491,788,60081,968,0001,068,0002,117,632stderr