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 listNov 23, 2024 18:03E SequeiraE SequeiraScore: 23,927Success
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:0323,4713,554,477,6703,506,682,00013,974,00017,190,912
2Nov 23, 2024 18:0323,6403,578,487,8353,534,023,00011,979,00017,162,240
3Nov 23, 2024 18:0323,6433,577,983,8253,530,442,00015,974,00016,965,632
4Nov 23, 2024 18:0323,7383,593,357,7583,541,756,00018,966,00017,039,360
5Nov 23, 2024 18:0323,9273,622,564,5133,575,095,00013,973,00017,174,528
6Nov 23, 2024 18:0323,9733,632,146,8323,579,920,00015,972,00016,990,208
7Nov 23, 2024 18:0324,2123,667,079,4003,615,758,00015,972,00017,104,896
8Nov 23, 2024 18:0324,2803,673,906,9933,627,086,00014,975,00017,190,912
9Nov 23, 2024 18:0324,3973,690,979,2373,644,648,00014,973,00017,137,664