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:07Sergey StreminSergey StreminScore: 66,372Success
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:0766,149227,658,511165,371,95802,260,992
2Dec 3, 2023 20:0766,265223,530,647165,663,53502,191,360
3Dec 3, 2023 20:0766,290196,199,283162,730,0002,995,0002,330,624
4Dec 3, 2023 20:0766,322193,846,938162,810,0002,996,0002,428,928
5Dec 3, 2023 20:0766,339195,073,875161,852,0003,996,0002,330,624
6Dec 3, 2023 20:0766,350191,496,079162,877,0002,997,0002,310,144
7Dec 3, 2023 20:0766,372194,409,726162,933,0002,998,0002,277,376
8Dec 3, 2023 20:0766,385189,865,092162,964,0002,999,0002,453,504
9Dec 3, 2023 20:0766,415196,771,112163,038,0003,000,0002,342,912
10Dec 3, 2023 20:0766,442197,703,428164,104,0002,001,0002,293,760
11Dec 3, 2023 20:0766,524194,167,858164,307,0002,003,0002,473,984
12Dec 3, 2023 20:0767,430230,911,747168,575,44102,203,648