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:41Kenneth 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:4100000Error: Exit with code 1: -2262469030063832151 -> -2262469030063832151 49152 86 b7 85 f6 37 e3 8f 9a 82 b4 5d a1 44 55 51 5dstderr