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 7, 2024 00:41Huy Duc LeHuy Duc LeScore: 3,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 00:412,966512,569,179444,891,252016,965,632
2Mar 7, 2024 00:412,968514,826,669445,144,874016,953,344
3Mar 7, 2024 00:412,971502,358,457445,667,528016,961,536
4Mar 7, 2024 00:413,012480,582,754428,810,00022,989,00017,195,008
5Mar 7, 2024 00:413,016479,077,357415,428,00036,949,00017,162,240
6Mar 7, 2024 00:413,018480,619,900422,737,00029,981,00016,965,632
7Mar 7, 2024 00:413,019476,542,038427,803,00024,988,00017,018,880
8Mar 7, 2024 00:413,025481,625,814427,717,00025,982,00017,121,280
9Mar 7, 2024 00:413,025477,119,504420,749,00032,980,00016,957,440
10Mar 7, 2024 00:413,027482,108,230429,051,00025,003,00016,957,440
11Mar 7, 2024 00:413,029478,903,467421,269,00033,021,00017,027,072
12Mar 7, 2024 00:413,030479,127,823414,541,00039,955,00017,170,432