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 listJan 4, 2026 04:14Josu San MartinJosu San MartinScore: 10,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 04:1410,21451,176,82222,470,0003,064,0002,293,760
2Jan 1, 2026 21:2110,23248,185,93717,395,0008,186,0002,301,952
3Jan 1, 2026 21:2110,24550,037,90619,466,0006,147,0002,359,296
4Jan 1, 2026 21:2110,24642,444,94320,493,0005,123,0002,486,272
5Jan 4, 2026 04:1310,25056,943,20018,450,0007,175,0002,498,560
6Jan 1, 2026 21:2110,27351,634,00119,519,0006,164,0002,478,080
7Jan 4, 2026 04:1410,27551,679,06719,523,0006,165,0002,306,048
8Jan 1, 2026 21:2110,27651,550,01519,525,0006,166,0002,310,144
9Jan 1, 2026 21:2110,27851,076,13119,529,0006,167,0002,310,144
10Jan 1, 2026 21:2110,27950,726,27617,475,0008,223,0002,314,240
11Jan 4, 2026 04:1410,28453,983,76420,568,0005,142,0002,289,664
12Jan 4, 2026 04:1310,33650,775,01419,878,0005,963,0002,306,048
13Jan 1, 2026 21:2110,34251,934,46722,873,0002,983,0002,375,680
14Jan 4, 2026 04:1410,34453,222,69620,887,0004,973,0002,306,048
15Jan 4, 2026 04:1410,36150,891,00319,926,0005,977,0002,441,216
16Jan 4, 2026 04:1310,41656,035,14522,034,0004,006,0002,289,664
17Jan 4, 2026 04:1410,41954,105,23021,038,0005,009,0002,433,024
18Jan 1, 2026 21:2110,45752,982,27220,110,0006,033,0002,342,912
19Jan 4, 2026 04:1410,49352,087,45623,206,0003,026,0002,301,952
20Jan 4, 2026 04:1410,49650,065,75222,203,0004,036,0002,392,064
21Jan 4, 2026 04:1410,52957,795,67720,249,0006,074,0002,330,624