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:47Andrew EpsteinAndrew EpsteinScore: 1,545Success
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:471,542240,653,963227,072,0004,330,00016,793,600
2Nov 4, 2026 02:471,545241,453,108227,534,0004,256,00016,793,600
3Nov 4, 2026 02:471,545241,039,803227,503,0004,311,00016,793,600
4Nov 4, 2026 02:471,545241,448,257227,522,0004,269,00016,793,600
5Nov 4, 2026 02:471,545241,441,396227,502,0004,268,00016,793,600
6Nov 4, 2026 02:471,545241,463,498227,557,0004,279,00016,793,600
7Nov 4, 2026 02:471,547241,402,354227,919,0004,142,00016,793,600
8Nov 4, 2026 02:471,548241,431,600227,919,0004,327,00016,793,600
9Nov 4, 2026 02:471,548241,473,822228,093,0004,162,00016,793,600