Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listMar 26, 2023 11:51Alexander MonakovAlexander MonakovScore: 4,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:513,998664,897,089599,725,980017,006,592
2Mar 26, 2023 11:514,000619,924,786584,050,00016,001,00017,080,320
3Mar 26, 2023 11:514,001661,839,340600,146,778017,010,688
4Mar 26, 2023 11:514,002633,446,191584,227,00016,006,00016,977,920
5Mar 26, 2023 11:514,003625,312,776584,495,00015,986,00017,100,800
6Mar 26, 2023 11:514,003623,882,223587,519,00012,989,00017,096,704
7Mar 26, 2023 11:514,003629,185,131581,526,00018,984,00016,965,632
8Mar 26, 2023 11:514,004622,377,771583,639,00016,989,00016,982,016
9Mar 26, 2023 11:514,004629,599,024581,683,00018,989,00017,104,896
10Mar 26, 2023 11:514,011661,715,942601,591,394017,010,688
11Mar 26, 2023 11:514,012622,194,929585,860,00015,996,00017,014,784
12Mar 26, 2023 11:514,017624,895,427585,544,00016,986,00017,178,624