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 03:04Andrew EpsteinAndrew EpsteinScore: 1,546Success
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 03:061,541240,491,836227,040,0004,193,00016,793,600
2Nov 4, 2026 03:061,541240,480,528227,036,0004,194,00016,793,600
3Nov 4, 2026 03:061,542242,559,485227,135,0004,247,00016,793,600
4Nov 4, 2026 03:061,544240,921,524227,490,0004,224,00016,793,600
5Nov 4, 2026 03:061,546249,992,781227,680,0004,277,00016,793,600
6Nov 4, 2026 03:061,547241,492,075227,960,0004,217,00016,793,600
7Nov 4, 2026 03:061,548241,908,638228,010,0004,224,00016,793,600
8Nov 4, 2026 03:061,584254,772,180233,391,0004,286,00016,793,600
9Nov 4, 2026 03:061,593267,679,422233,887,0005,173,00016,793,600