Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listDec 15, 2023 20:59Oleg KovalovOleg KovalovScore: 1,651,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 20:591,651,5674,198,129,1224,128,918,08602,256,896
2Dec 15, 2023 20:591,651,8824,202,598,3594,129,705,59802,183,168
3Dec 15, 2023 20:591,651,9534,185,202,8024,129,883,58602,183,168