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:36E 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:3600000Error: Exit with code 2: panic: runtime error: slice bounds out of range [:63] with capacity 62 goroutine 1 [running]: main.karatsubaMultiply({0x7d3a92e85078, 0x1f, 0xf406}, {0x7d3a92ec2108, 0x1f, 0xf406}) /tmp/solution1066466925/main.go:63 +0x434 ma...stderr