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 24, 2023 16:28Kenneth MaplesKenneth MaplesScore: 626,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 16:28625,7441,621,569,3331,564,359,16802,301,952
2Dec 24, 2023 16:28626,4051,628,073,8741,566,012,69502,265,088
3Dec 24, 2023 16:28627,5281,633,969,9061,568,819,75302,265,088