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 19, 2023 11:37Kenneth MaplesKenneth MaplesScore: 740,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2023 11:37740,4291,920,682,0741,851,073,73802,306,048
2Dec 19, 2023 11:37740,4871,921,335,9711,851,217,88602,174,976
3Dec 19, 2023 11:37741,5981,910,137,4441,853,993,95102,187,264