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 11, 2023 17:39Bernard TeoBernard TeoScore: 35,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2023 17:3935,050112,616,36587,624,00002,396,160
2Jul 11, 2023 17:3935,059108,627,87987,648,00002,330,624
3Jul 11, 2023 17:3935,086113,596,34387,715,00002,408,448
4Jul 11, 2023 17:3935,089114,004,97286,714,0001,008,0002,404,352
5Jul 11, 2023 17:3935,146114,508,58186,867,000998,0002,330,624
6Jul 11, 2023 17:3935,147116,156,72686,870,000998,0002,330,624
7Jul 11, 2023 17:3935,152119,494,80185,883,0001,997,0002,330,624
8Jul 11, 2023 17:3935,168110,538,63284,923,0002,997,0002,400,256
9Jul 11, 2023 17:3935,181113,121,70786,953,000999,0002,297,856
10Jul 11, 2023 17:3937,107157,059,74892,767,27402,252,800
11Jul 11, 2023 17:3937,114148,607,77092,784,10302,252,800
12Jul 11, 2023 17:3937,166147,919,99392,914,29702,248,704