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 21, 2023 10:19Oleg KovalovOleg KovalovScore: 1,683,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2023 10:191,682,9844,268,580,2804,207,458,87702,252,800
2Dec 21, 2023 10:191,683,2824,273,115,9704,208,204,28202,252,800
3Dec 21, 2023 10:191,683,3304,278,972,2374,208,325,91402,256,896