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 listMay 27, 2024 16:12Joad NacerJoad NacerScore: 1,188,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 16:121,184,2853,021,910,4572,960,711,45802,289,664
2May 27, 2024 16:121,188,3163,032,561,9152,970,790,77502,297,856
3May 27, 2024 16:121,188,8163,036,344,2872,972,040,09402,285,568