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 3, 2023 20:08Sergey StreminSergey StreminScore: 62,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 20:0861,515183,798,106148,794,0004,993,0002,498,560
2Dec 3, 2023 20:0861,723178,335,761152,304,0002,004,0002,334,720
3Dec 3, 2023 20:0861,779209,204,000154,448,38902,281,472
4Dec 3, 2023 20:0862,000186,178,992149,001,0006,000,0002,461,696
5Dec 3, 2023 20:0862,104178,065,380149,250,0006,010,0002,334,720
6Dec 3, 2023 20:0862,118188,770,277149,284,0006,011,0002,371,584
7Dec 3, 2023 20:0862,168183,011,145151,409,0004,010,0002,367,488
8Dec 3, 2023 20:0862,182179,512,406151,445,0004,011,0002,355,200
9Dec 3, 2023 20:0862,255185,764,840152,626,0003,012,0002,523,136
10Dec 3, 2023 20:0862,342217,411,649155,853,82102,285,568
11Dec 3, 2023 20:0862,576183,684,459151,425,0005,014,0002,445,312
12Dec 3, 2023 20:0863,519221,739,607158,797,10402,220,032