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 01:29Andrew EpsteinAndrew EpsteinScore: 1,558Success
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 01:291,557243,359,056229,289,0004,391,00016,793,600
2Nov 4, 2026 01:291,558243,475,924229,451,0004,381,00016,793,600
3Nov 4, 2026 01:291,558243,193,332229,424,0004,360,00016,793,600
4Nov 4, 2026 01:291,558243,106,503229,427,0004,362,00016,793,600
5Nov 4, 2026 01:291,558243,103,969229,383,0004,360,00016,793,600
6Nov 4, 2026 01:291,559243,506,601229,626,0004,225,00016,793,600
7Nov 4, 2026 01:291,562244,116,413230,071,0004,276,00016,793,600
8Nov 4, 2026 01:291,562244,059,270230,039,0004,284,00016,793,600
9Nov 4, 2026 01:291,562244,133,956230,141,0004,275,00016,793,600