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:28Andrew EpsteinAndrew EpsteinScore: 1,568Success
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:291,567244,866,657228,396,0006,729,00016,793,600
2Nov 4, 2026 02:291,567244,902,723228,397,0006,750,00016,793,600
3Nov 4, 2026 02:291,568245,018,532228,467,0006,746,00016,793,600
4Nov 4, 2026 02:291,568245,545,320228,502,0006,761,00016,793,600
5Nov 4, 2026 02:291,568244,902,612228,481,0006,738,00016,793,600
6Nov 4, 2026 02:291,569245,070,558229,453,0005,916,00016,793,600
7Nov 4, 2026 02:291,571245,412,254228,869,0006,822,00016,793,600
8Nov 4, 2026 02:291,571245,686,321228,929,0006,819,00016,793,600
9Nov 4, 2026 02:291,572246,325,240229,189,0006,697,00016,793,600