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 24, 2024 18:52mahdi739mahdi739Score: 49,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 18:5249,119438,066,195405,687,0001,998,0002,371,584
2Dec 24, 2024 18:5249,148432,286,668405,931,0001,999,0002,285,568
3Dec 24, 2024 18:5249,149432,030,296405,940,0001,999,0002,285,568
4Dec 24, 2024 18:5249,177434,177,186408,168,00002,285,568
5Dec 24, 2024 18:5249,177428,302,304407,168,0001,000,0002,367,488
6Dec 24, 2024 18:5249,177430,800,800407,171,0001,000,0002,375,680
7Dec 24, 2024 18:5249,191442,281,329407,284,0001,000,0002,285,568
8Dec 24, 2024 18:5249,191433,917,158407,285,0001,000,0002,281,472
9Dec 24, 2024 18:5249,200434,413,521407,359,0001,000,0002,371,584