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:54Andrew EpsteinAndrew EpsteinScore: 23,660Success
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:5523,6503,557,586,3953,492,263,00055,366,00016,801,792stderr
2Nov 4, 2026 01:5523,6533,558,152,7783,493,063,00054,961,00016,801,792stderr
3Nov 4, 2026 01:5523,6533,557,583,4303,492,989,00054,993,00016,801,792stderr
4Nov 4, 2026 01:5523,6583,558,444,3743,493,482,00055,263,00016,801,792stderr
5Nov 4, 2026 01:5523,6603,558,622,5763,494,390,00054,748,00016,801,792stderr
6Nov 4, 2026 01:5523,6603,558,981,3173,494,102,00054,917,00016,801,792stderr
7Nov 4, 2026 01:5523,7133,567,080,2773,501,751,00055,314,00016,801,792stderr
8Nov 4, 2026 01:5523,7163,567,345,3993,502,105,00055,355,00016,801,792stderr
9Nov 4, 2026 01:5523,7163,567,389,2133,501,782,00055,721,00016,801,792stderr