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 listDec 12, 2024 23:46Joad NacerJoad NacerScore: 32,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 23:4632,676105,846,62179,673,0002,017,0002,420,736
2Dec 12, 2024 23:4632,687105,745,87781,718,00002,416,640
3Dec 12, 2024 23:4632,688106,215,51881,719,00002,510,848
4Dec 12, 2024 23:4632,743107,394,78378,864,0002,994,0002,363,392
5Dec 12, 2024 23:4632,747106,465,88678,873,0002,995,0002,412,544
6Dec 12, 2024 23:4632,759106,347,98177,902,0003,995,0002,535,424
7Dec 12, 2024 23:4632,768108,770,19580,922,000999,0002,347,008
8Dec 12, 2024 23:4632,834106,995,93782,086,00002,314,240
9Dec 12, 2024 23:4632,928106,596,19981,317,0001,003,0002,355,200