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 listAug 10, 2023 06:36parsersmailparsersmailScore: 1,261,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 06:361,260,5413,220,017,0943,151,351,89302,260,992
2Aug 10, 2023 06:361,261,2443,209,562,7963,153,110,74202,256,896
3Aug 10, 2023 06:361,262,5653,220,927,2193,156,411,33102,248,704