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 listApr 2, 2025 15:23CountHarebourgCountHarebourgScore: 381,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2025 15:23380,89757,194,674,40357,081,613,00052,966,00017,059,840
2Apr 2, 2025 15:23381,49157,282,385,88857,180,726,00042,974,00017,014,784
3Apr 2, 2025 15:23381,70957,323,164,81457,197,338,00058,963,00016,973,824
4Apr 2, 2025 15:23381,74557,319,562,39957,206,729,00054,966,00016,957,440
5Apr 2, 2025 15:23381,78557,328,435,15957,222,714,00044,971,00016,973,824
6Apr 2, 2025 15:23382,07257,371,178,00957,265,883,00044,970,00017,137,664
7Apr 2, 2025 15:23382,30757,408,587,10857,292,009,00053,968,00017,190,912
8Apr 2, 2025 15:23382,73157,465,742,46757,363,634,00045,973,00016,990,208
9Apr 2, 2025 15:23383,03757,515,791,38257,406,520,00048,971,00016,973,824