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 25, 2025 17:40Daniel MastalerzDaniel MastalerzScore: 46,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 17:4046,306412,759,517382,340,0002,001,0002,269,184
2Sep 25, 2025 17:4046,407413,031,965382,177,0003,001,0002,281,472
3Sep 25, 2025 17:4046,452414,151,095382,555,0002,996,0002,269,184
4Sep 25, 2025 17:4046,592408,140,745384,719,0001,998,0002,269,184
5Sep 25, 2025 17:4046,637410,767,514386,085,0001,000,0002,387,968
6Sep 25, 2025 17:4046,640412,469,263385,110,0002,000,0002,269,184
7Sep 25, 2025 17:4046,655410,072,117387,234,00002,269,184
8Sep 25, 2025 17:4046,658413,418,668385,259,0002,001,0002,269,184
9Sep 25, 2025 17:4046,666417,122,836387,324,00002,396,160