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 8, 2023 22:45LiamLiamScore: 1,269,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2023 22:451,267,0453,230,031,5333,167,611,67002,203,648
2Sep 8, 2023 22:451,269,5693,238,563,7203,173,922,80602,187,264
3Sep 8, 2023 22:451,269,9393,247,920,2763,174,846,87202,203,648