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 20:10Kenneth MaplesKenneth MaplesScore: 302,559Success
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 20:10302,523835,697,349756,308,38002,301,952
2Dec 24, 2023 20:10302,559817,946,081756,397,87902,306,048
3Dec 24, 2023 20:10302,641812,005,293756,602,64002,306,048