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 4, 2024 21:26Casper BelierCasper BelierScore: 1,262,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 21:261,260,6003,181,830,4853,149,501,0001,999,0002,342,912
2Sep 4, 2024 21:261,260,7543,180,034,8363,149,886,0001,998,0002,285,568
3Sep 4, 2024 21:261,262,0203,183,824,7523,154,050,000999,0002,293,760
4Sep 4, 2024 21:261,262,3083,180,228,1293,153,773,0001,998,0002,334,720
5Sep 4, 2024 21:261,262,7973,181,575,1293,154,994,0001,998,0002,293,760
6Sep 4, 2024 21:261,263,5393,182,439,3343,156,849,0001,999,0002,338,816
7Sep 4, 2024 21:261,264,4383,184,881,2033,159,096,0001,998,0002,293,760
8Sep 4, 2024 21:261,265,4833,186,261,9693,162,708,000999,0002,285,568
9Sep 4, 2024 21:261,266,8503,197,927,3053,164,126,0002,998,0002,293,760