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 7, 2024 11:43NoSIMD_C#NoSIMD_C#Score: 382,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 11:43381,15757,234,146,90057,120,571,00052,969,00017,162,240
2Nov 7, 2024 11:43381,37757,268,180,28357,162,555,00043,974,00017,076,224
3Nov 7, 2024 11:43381,97857,361,751,72757,258,696,00037,975,00017,088,512
4Nov 7, 2024 11:43382,32257,407,578,05957,299,312,00048,967,00016,982,016
5Nov 7, 2024 11:43382,57757,451,969,60657,344,587,00041,975,00017,174,528
6Nov 7, 2024 11:43382,64757,459,505,30557,347,069,00049,968,00017,059,840
7Nov 7, 2024 11:43382,79657,477,172,68157,375,445,00043,974,00016,973,824
8Nov 7, 2024 11:43382,82157,477,893,53957,377,202,00045,973,00016,973,824
9Nov 7, 2024 11:43383,12257,527,415,51957,423,366,00044,972,00016,953,344