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:48Kenneth 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:4800000Error: Exit with code 1: xxx 16406 75 9c 44 dd 07 e1 3a c2 76 9c 44 dd 07 e1 3a c2stderr
2Dec 24, 2023 18:4900000Error: Exit with code 1: xxx 16392 32 f2 0b f2 54 19 9b ca 33 f2 0b f2 54 19 9b castderr