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 listSep 9, 2023 02:16LiamLiamScore: 1,262,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2023 02:161,261,2993,215,708,9043,153,246,28402,248,704
2Sep 9, 2023 02:161,262,0583,217,054,2363,155,146,08702,260,992
3Sep 9, 2023 02:161,262,2933,227,607,6973,155,732,09602,260,992