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:33Kenneth MaplesKenneth MaplesScore: 255,443Success
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:33255,398713,082,224638,494,54702,301,952
2Dec 24, 2023 19:33255,443697,251,006638,607,64302,301,952
3Dec 24, 2023 19:33255,629707,289,496639,073,43602,289,664