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 02:45Andrew EpsteinAndrew EpsteinScore: 23,218Success
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 02:4623,2113,491,246,9903,426,887,00054,838,00016,801,792stderr
2Nov 4, 2026 02:4623,2113,491,537,7583,426,729,00055,020,00016,801,792stderr
3Nov 4, 2026 02:4623,2153,492,006,8803,426,966,00055,361,00016,801,792stderr
4Nov 4, 2026 02:4623,2173,492,163,5423,427,738,00054,960,00016,801,792stderr
5Nov 4, 2026 02:4623,2183,492,665,8103,427,844,00054,904,00016,801,792stderr
6Nov 4, 2026 02:4623,2193,492,819,8853,427,895,00054,990,00016,801,792stderr
7Nov 4, 2026 02:4623,2623,498,756,9323,433,816,00055,519,00016,801,792stderr
8Nov 4, 2026 02:4623,2623,499,353,1383,433,846,00055,579,00016,801,792stderr
9Nov 4, 2026 02:4623,2643,499,165,5853,434,253,00055,485,00016,801,792stderr