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 4, 2026 00:56Andrew EpsteinAndrew EpsteinScore: 1,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 00:571,558243,798,678229,416,0004,396,00016,793,600
2Nov 4, 2026 00:571,559243,591,140229,570,0004,386,00016,793,600
3Nov 4, 2026 00:571,559243,230,161229,674,0004,280,00016,793,600
4Nov 4, 2026 00:571,559243,170,918229,567,0004,359,00016,793,600
5Nov 4, 2026 00:571,560243,565,593229,913,0004,218,00016,793,600
6Nov 4, 2026 00:571,561243,497,881229,966,0004,240,00016,793,600
7Nov 4, 2026 00:571,562243,794,279230,324,0004,109,00016,793,600
8Nov 4, 2026 00:571,563244,300,772230,284,0004,266,00016,793,600
9Nov 4, 2026 00:571,564244,340,320230,413,0004,262,00016,793,600