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 25, 2023 08:32Alexander MonakovAlexander MonakovScore: 4,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 08:324,147646,360,720607,063,00015,001,00017,006,592
2Mar 25, 2023 08:324,147642,856,499608,118,00014,002,00017,092,608
3Mar 25, 2023 08:324,150647,775,280606,533,00015,987,00017,096,704
4Mar 25, 2023 08:324,150650,996,671607,532,00014,988,00017,022,976
5Mar 25, 2023 08:324,150644,432,437604,559,00017,986,00017,125,376
6Mar 25, 2023 08:324,151643,108,722613,690,0008,995,00016,990,208
7Mar 25, 2023 08:324,153650,845,128605,932,00016,998,00017,096,704
8Mar 25, 2023 08:324,154641,002,635609,074,00014,001,00017,100,800
9Mar 25, 2023 08:324,212701,556,978631,800,514017,010,688
10Mar 25, 2023 08:324,274715,847,531641,106,565016,945,152
11Mar 25, 2023 08:324,280694,459,542641,996,694017,002,496
12Mar 25, 2023 08:324,322672,433,918636,287,00012,005,00017,088,512