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 listMar 26, 2026 13:11Dominique GarmierDominique GarmierScore: 8,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 09:478,23048,924,18017,490,0003,086,0002,306,048
2Mar 24, 2026 09:478,27650,205,69818,621,0002,069,0002,387,968
3Mar 24, 2026 09:478,28344,563,74417,602,0003,106,0002,506,752
4Mar 24, 2026 09:478,28849,586,49417,613,0003,108,0002,265,088
5Mar 24, 2026 09:478,32049,265,30116,838,0003,962,0002,281,472
6Mar 26, 2026 13:118,35153,147,98413,918,0006,959,0002,486,272
7Mar 24, 2026 09:478,38447,275,15713,973,0006,986,0002,473,984
8Mar 24, 2026 09:478,50038,211,53315,178,0006,071,0002,510,848
9Mar 26, 2026 13:118,50446,832,37217,212,0004,049,0002,293,760
10Mar 24, 2026 09:478,57543,198,33917,355,0004,083,0002,281,472
11Mar 24, 2026 09:478,57845,283,42417,360,0004,084,0002,367,488
12Mar 26, 2026 13:118,64248,891,07219,548,0002,057,0002,424,832