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:36Kenneth MaplesKenneth MaplesScore: 1,186,342Success
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:361,185,7233,017,449,3072,964,306,86502,179,072
2Dec 19, 2023 11:361,186,3423,023,585,5512,965,855,92302,179,072
3Dec 19, 2023 11:361,186,5793,032,483,1262,966,447,26402,179,072