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 17:23Andrew EpsteinAndrew EpsteinScore: 1,588Success
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 17:241,586246,493,565233,548,0004,364,00016,793,600
2Sep 21, 2026 17:241,586247,334,350233,553,0004,368,00016,793,600
3Sep 21, 2026 17:241,586246,673,617233,579,0004,388,00016,793,600
4Sep 21, 2026 17:241,587247,556,214233,770,0004,350,00016,793,600
5Sep 21, 2026 17:241,588246,899,204233,828,0004,395,00016,793,600
6Sep 21, 2026 17:241,589247,830,653234,144,0004,240,00016,793,600
7Sep 21, 2026 17:241,590248,029,430234,466,0004,094,00016,793,600
8Sep 21, 2026 17:241,590248,004,186234,310,0004,254,00016,793,600
9Sep 21, 2026 17:241,590248,013,954234,368,0004,256,00016,793,600