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 01:58Andrew EpsteinAndrew EpsteinScore: 23,367Success
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 01:5923,3613,514,150,2263,449,362,00054,824,00016,801,792stderr
2Nov 4, 2026 01:5923,3643,514,680,4643,450,071,00054,607,00016,801,792stderr
3Nov 4, 2026 01:5923,3663,514,918,5923,450,248,00054,763,00016,801,792stderr
4Nov 4, 2026 01:5923,3673,514,556,9943,450,252,00054,835,00016,801,792stderr
5Nov 4, 2026 01:5923,3673,514,729,6843,450,483,00054,647,00016,801,792stderr
6Nov 4, 2026 01:5923,3733,516,060,3723,451,233,00054,851,00016,801,792stderr
7Nov 4, 2026 01:5923,4143,522,224,1153,456,932,00055,307,00016,801,792stderr
8Nov 4, 2026 01:5923,4173,522,495,7873,457,357,00055,250,00016,801,792stderr
9Nov 4, 2026 01:5923,4243,523,211,4133,458,330,00055,384,00016,801,792stderr