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 listAug 11, 2025 17:02Ian MckibbenIan MckibbenScore: 14,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 17:0214,209144,216,646115,938,0001,998,0002,428,928
2Aug 11, 2025 17:0214,218138,345,783117,006,0001,000,0002,428,928
3Aug 11, 2025 17:0214,218141,240,966117,010,0001,000,0002,531,328
4Aug 11, 2025 17:0214,221142,064,016117,031,0001,000,0002,510,848
5Aug 11, 2025 17:0214,229141,406,284116,096,0002,001,0002,531,328
6Aug 11, 2025 17:0214,230142,511,357117,105,0001,000,0002,531,328
7Aug 11, 2025 17:0214,230140,366,969117,108,0001,000,0002,433,024
8Aug 11, 2025 17:0214,230137,740,544116,109,0002,001,0002,269,184
9Aug 11, 2025 17:0214,232141,212,894117,121,0001,001,0002,531,328