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 27, 2023 10:31Oleg KovalovOleg KovalovScore: 3,942,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2023 10:313,940,3159,921,866,2959,850,786,79502,203,648
2Dec 27, 2023 10:313,942,2459,936,771,1019,855,613,12402,191,360
3Dec 27, 2023 10:313,943,4769,916,780,8539,858,690,33102,199,552