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,542Success
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,540240,383,693226,770,0004,294,00016,793,600
2Nov 4, 2026 03:061,541240,515,552226,853,0004,307,00016,793,600
3Nov 4, 2026 03:061,542240,693,667227,163,0004,162,00016,793,600
4Nov 4, 2026 03:061,542240,770,049227,111,0004,194,00016,793,600
5Nov 4, 2026 03:061,542240,721,389227,160,0004,183,00016,793,600
6Nov 4, 2026 03:061,543240,998,146227,350,0004,198,00016,793,600
7Nov 4, 2026 03:061,545241,136,134227,609,0004,215,00016,793,600
8Nov 4, 2026 03:061,546241,350,868227,811,0004,223,00016,793,600
9Nov 4, 2026 03:061,546241,259,924227,755,0004,217,00016,793,600