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 00:39Andrew EpsteinAndrew EpsteinScore: 1,571Success
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 00:401,569246,675,092231,101,0004,365,00016,793,600
2Nov 4, 2026 00:401,569245,135,495231,117,0004,378,00016,793,600
3Nov 4, 2026 00:401,570245,337,213231,380,0004,226,00016,793,600
4Nov 4, 2026 00:401,570245,328,324231,384,0004,241,00016,793,600
5Nov 4, 2026 00:401,571245,362,027231,295,0004,383,00016,793,600
6Nov 4, 2026 00:401,571245,311,008231,274,0004,397,00016,793,600
7Nov 4, 2026 00:401,574245,876,975232,023,0004,123,00016,793,600
8Nov 4, 2026 00:401,574245,598,862231,992,0004,114,00016,793,600
9Nov 4, 2026 00:401,575246,165,491231,992,0004,280,00016,793,600