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 listDec 8, 2025 11:24luckyhwanluckyhwanScore: 60,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:2459,915524,196,879497,294,00002,383,872
2Dec 8, 2025 11:2460,027519,143,047496,224,0002,000,0002,387,968
3Dec 8, 2025 11:2460,034521,893,937497,280,0001,000,0002,519,040
4Dec 8, 2025 11:2460,038520,988,537498,313,00002,260,992
5Dec 8, 2025 11:2460,039522,696,918498,321,00002,510,848
6Dec 8, 2025 11:2460,040524,532,193496,335,0002,001,0002,396,160
7Dec 8, 2025 11:2460,041519,058,868497,341,0001,000,0002,256,896
8Dec 8, 2025 11:2460,043530,711,610497,359,0001,000,0002,514,944
9Dec 8, 2025 11:2460,073524,789,790495,611,0002,997,0002,383,872