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 19:34Kenneth MaplesKenneth MaplesScore: 341,253Success
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 19:34341,031910,646,607852,576,65302,301,952
2Dec 24, 2023 19:34341,253920,786,050853,132,12602,297,856
3Dec 24, 2023 19:34341,309912,101,975853,271,63102,301,952