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 8, 2024 06:48E SequeiraE SequeiraScore: 401,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 18:12401,4101,032,071,4981,001,527,0001,999,0002,285,568
2Nov 23, 2024 18:12401,4361,026,747,0431,001,591,0001,999,0002,404,352
3Nov 23, 2024 18:12401,5081,031,174,9971,001,771,0001,999,0002,297,856
4Dec 8, 2024 06:48401,5401,031,821,1001,002,851,000999,0002,289,664
5Nov 23, 2024 18:12401,5751,031,283,9641,002,938,000999,0002,297,856
6Nov 23, 2024 18:12401,5981,039,824,3861,001,997,0001,998,0002,285,568
7Nov 23, 2024 18:12401,6051,032,774,5661,003,012,0001,000,0002,297,856
8Dec 8, 2024 06:48401,6141,031,586,3341,002,036,0001,998,0002,285,568
9Dec 8, 2024 06:48401,7611,034,477,6091,004,403,00002,289,664
10Nov 23, 2024 18:12401,8401,026,800,8691,002,602,0001,999,0002,297,856
11Nov 23, 2024 18:12401,9011,032,688,2951,002,753,0001,999,0002,285,568
12Nov 23, 2024 18:12401,9401,034,808,0611,003,852,000998,0002,297,856