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 listNov 29, 2024 22:31E SequeiraE SequeiraError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 22:3100000Error: Exit with code 2: panic: runtime error: slice bounds out of range [:3908] with capacity 3906 goroutine 1 [running]: main.karatsubaMultiply({0xc000186000?, 0x7a2, 0x0?}, {0xc00018a000?, 0xc000068b01?, 0x7a2}, {0xc00015a000?, 0xf42?, 0xe4e2?}) /...stderr