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 9, 2023 23:08gchebanovgchebanovScore: 16,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 23:0816,56665,761,37635,355,0006,060,0002,445,312
2Jul 9, 2023 23:0816,74068,100,14933,880,0007,971,0002,478,080
3Jul 9, 2023 23:0816,76766,359,05131,937,0009,980,0002,469,888
4Jul 9, 2023 23:0816,77463,576,71033,948,0007,987,0002,379,776
5Jul 9, 2023 23:0816,79268,471,25232,984,0008,995,0002,424,832
6Jul 9, 2023 23:0816,83070,819,64036,064,0006,010,0002,433,024
7Jul 9, 2023 23:0816,83469,849,22331,062,00011,022,0002,383,872
8Jul 9, 2023 23:0817,14773,118,71636,886,0005,981,0002,383,872
9Jul 9, 2023 23:0817,40364,172,29236,426,0007,082,0002,408,448
10Jul 9, 2023 23:0817,867119,560,97144,667,67302,174,976
11Jul 9, 2023 23:0817,977103,086,02344,941,30502,211,840
12Jul 9, 2023 23:0818,356118,945,31845,890,96302,220,032