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:37Andrew EpsteinAndrew EpsteinScore: 1,613Success
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:381,610252,092,883237,442,0004,189,00016,793,600
2Sep 21, 2026 16:381,611254,550,883237,480,0004,225,00016,793,600
3Sep 21, 2026 16:381,611251,918,245237,406,0004,326,00016,793,600
4Sep 21, 2026 16:381,611252,288,293237,561,0004,230,00016,793,600
5Sep 21, 2026 16:381,613253,556,333237,857,0004,207,00016,793,600
6Sep 21, 2026 16:381,613252,400,979237,888,0004,208,00016,793,600
7Sep 21, 2026 16:381,614252,381,611237,875,0004,271,00016,793,600
8Sep 21, 2026 16:381,615252,553,940238,068,0004,205,00016,793,600
9Sep 21, 2026 16:381,616252,673,000238,228,0004,191,00016,793,600