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 listJul 12, 2023 17:29Bernard TeoBernard TeoScore: 35,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 17:2935,470117,663,32088,676,00002,330,624
2Jul 12, 2023 17:2935,545114,772,47987,864,000998,0002,392,064
3Jul 12, 2023 17:2935,546115,167,25587,868,000998,0002,330,624
4Jul 12, 2023 17:2935,548118,826,09886,873,0001,997,0002,330,624
5Jul 12, 2023 17:2935,551119,177,64686,880,0001,997,0002,314,240
6Jul 12, 2023 17:2935,552114,692,82486,884,0001,997,0002,314,240
7Jul 12, 2023 17:2935,554119,124,86287,886,000998,0002,297,856
8Jul 12, 2023 17:2935,586110,764,92287,965,000999,0002,330,624
9Jul 12, 2023 17:2935,794114,649,96988,479,0001,005,0002,392,064
10Jul 12, 2023 17:2936,894156,930,92592,236,02802,248,704
11Jul 12, 2023 17:2937,171158,729,49492,927,07002,236,416
12Jul 12, 2023 17:2937,616167,943,05094,039,24902,252,800