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 listFeb 23, 2024 16:06Huy Duc LeHuy Duc LeScore: 371,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2024 16:06370,181986,248,500925,452,30602,297,856
2Feb 23, 2024 16:06371,129982,580,684927,823,24902,281,472
3Feb 23, 2024 16:06371,765996,580,971929,411,56402,285,568