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 listSep 21, 2026 16:01Andrew EpsteinAndrew EpsteinScore: 1,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:011,618253,617,428238,575,0004,159,00016,793,600
2Sep 21, 2026 16:011,620253,544,194238,889,0004,160,00016,793,600
3Sep 21, 2026 16:011,620253,418,009238,972,0004,165,00016,793,600
4Sep 21, 2026 16:011,620253,440,314238,795,0004,211,00016,793,600
5Sep 21, 2026 16:011,621254,241,267239,075,0004,166,00016,793,600
6Sep 21, 2026 16:011,621253,621,344239,025,0004,211,00016,793,600
7Sep 21, 2026 16:011,623254,611,266239,339,0004,236,00016,793,600
8Sep 21, 2026 16:011,623253,900,904239,312,0004,265,00016,793,600
9Sep 21, 2026 16:011,624253,830,966239,410,0004,190,00016,793,600