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,934Success
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:049,812140,401,12480,383,0001,059,0002,117,632stderr
2Sep 17, 2026 14:049,880140,939,61481,002,0001,003,0002,117,632stderr
3Sep 17, 2026 14:049,897141,028,74381,049,0001,103,0002,117,632stderr
4Sep 17, 2026 14:049,933141,341,18281,354,0001,090,0002,117,632stderr
5Sep 17, 2026 14:049,934141,388,66981,357,0001,103,0002,117,632stderr
6Sep 17, 2026 14:049,937142,868,54381,418,0001,065,0002,117,632stderr
7Sep 17, 2026 14:049,943141,408,51781,469,0001,065,0002,117,632stderr
8Sep 17, 2026 14:049,943141,345,53081,467,0001,064,0002,117,632stderr
9Sep 17, 2026 14:049,978141,719,82881,724,0001,094,0002,117,632stderr