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 5, 2024 09:45Huy Duc LeHuy Duc LeScore: 4,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2024 09:454,089683,353,071613,394,220016,912,384
2Mar 5, 2024 09:454,092675,772,236613,868,868016,900,096
3Mar 5, 2024 09:454,104638,663,305587,654,00027,983,00017,162,240
4Mar 5, 2024 09:454,105682,752,399615,721,920016,908,288
5Mar 5, 2024 09:454,106641,370,887582,882,00032,993,00017,141,760
6Mar 5, 2024 09:454,106640,894,907586,914,00028,995,00017,178,624
7Mar 5, 2024 09:454,107639,083,896585,979,00029,998,00017,055,744
8Mar 5, 2024 09:454,107641,223,850597,039,00019,001,00016,990,208
9Mar 5, 2024 09:454,107639,150,891585,049,00031,002,00017,043,456
10Mar 5, 2024 09:454,108647,922,861590,147,00026,006,00017,043,456
11Mar 5, 2024 09:454,119640,510,128593,907,00023,996,00017,047,552
12Mar 5, 2024 09:454,120645,127,650587,003,00031,000,00017,051,648