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:44Kenneth MaplesKenneth MaplesScore: 740,921Success
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:44740,3681,921,586,3651,850,919,52002,174,976
2Dec 19, 2023 11:44740,9211,910,766,2891,852,302,54002,191,360
3Dec 19, 2023 11:44742,0031,924,864,5921,855,008,12902,179,072