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 18:42Kenneth MaplesKenneth MaplesError
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 18:4200000Error: Exit with code 1: 16661931980175355323 -> 15051784605476755851 49152 27 15 4c 29 12 b9 34 d5 8d a7 6c b5 49 41 90 10stderr