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:04Andrew EpsteinAndrew EpsteinScore: 23,420Success
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:0523,4113,521,374,5903,456,775,00054,946,00016,801,792stderr
2Nov 4, 2026 02:0523,4123,521,441,1663,457,268,00054,536,00016,801,792stderr
3Nov 4, 2026 02:0523,4143,521,575,8873,457,405,00054,803,00016,801,792stderr
4Nov 4, 2026 02:0523,4183,522,230,5763,458,335,00054,499,00016,801,792stderr
5Nov 4, 2026 02:0523,4203,522,883,4763,458,182,00054,849,00016,801,792stderr
6Nov 4, 2026 02:0523,4243,523,403,8353,458,541,00055,125,00016,801,792stderr
7Nov 4, 2026 02:0523,4673,529,563,9143,464,886,00055,243,00016,801,792stderr
8Nov 4, 2026 02:0523,4703,530,067,1943,465,342,00055,260,00016,801,792stderr
9Nov 4, 2026 02:0523,4733,530,507,3963,465,806,00055,290,00016,801,792stderr