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:18Kenneth MaplesKenneth MaplesScore: 341,157Success
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:18341,104914,777,214852,759,59602,179,072
2Dec 24, 2023 19:18341,157914,887,618852,891,76802,179,072
3Dec 24, 2023 19:18341,521920,335,977853,802,93202,289,664