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 listFeb 23, 2024 15:57Huy Duc LeHuy Duc LeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2024 15:5700000Error: Exit with code 1: Current stack size limit: 8388608 bytes input cost = 0.254525 AddressSanitizer:DEADLYSIGNAL ================================================================= ==1==ERROR: AddressSanitizer: stack-overflow on address 0x7ffde70fd9a...stderr