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:21LiamLiamScore: 1,151,482Success
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:211,151,3272,963,668,7702,878,317,04402,256,896
2Sep 9, 2023 02:211,151,4822,948,560,4922,878,704,43402,256,896
3Sep 9, 2023 02:211,153,8262,947,810,6102,884,565,88802,252,800