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:27Andrew EpsteinAndrew EpsteinScore: 1,552Success
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:281,550242,151,023228,279,0004,229,00016,793,600
2Nov 4, 2026 02:281,550242,229,342228,288,0004,236,00016,793,600
3Nov 4, 2026 02:281,550242,329,036228,392,0004,215,00016,793,600
4Nov 4, 2026 02:281,550242,332,837228,319,0004,240,00016,793,600
5Nov 4, 2026 02:281,552242,592,999228,540,0004,288,00016,793,600
6Nov 4, 2026 02:281,552242,572,786228,561,0004,256,00016,793,600
7Nov 4, 2026 02:281,553243,397,583228,815,0004,270,00016,793,600
8Nov 4, 2026 02:281,553243,162,681228,746,0004,288,00016,793,600
9Nov 4, 2026 02:281,554243,641,568228,998,0004,142,00016,793,600