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 listOct 13, 2026 20:11Karthik ReddyKarthik ReddyScore: 1,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 20:141,557242,862,858228,631,0005,068,00016,793,600
2Oct 13, 2026 20:141,558242,922,990229,585,0004,223,00016,793,600
3Oct 13, 2026 20:141,559243,014,805229,624,0004,237,00016,793,600
4Oct 13, 2026 20:141,559243,025,889229,721,0004,229,00016,793,600
5Oct 13, 2026 20:141,559242,973,199229,656,0004,226,00016,793,600
6Oct 13, 2026 20:141,560243,070,174229,787,0004,230,00016,793,600
7Oct 13, 2026 20:141,561243,315,547229,989,0004,273,00016,793,600
8Oct 13, 2026 20:141,561243,183,239229,916,0004,258,00016,793,600
9Oct 13, 2026 20:141,562243,534,447230,058,0004,290,00016,793,600