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:37Andrew EpsteinAndrew EpsteinScore: 1,556Success
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:371,555243,025,216229,121,0004,244,00016,793,600
2Nov 4, 2026 01:371,555243,003,101229,195,0004,103,00016,793,600
3Nov 4, 2026 01:371,555242,984,911229,117,0004,280,00016,793,600
4Nov 4, 2026 01:371,555242,594,695229,111,0004,219,00016,793,600
5Nov 4, 2026 01:371,556243,102,599229,209,0004,226,00016,793,600
6Nov 4, 2026 01:371,556243,480,640229,161,0004,262,00016,793,600
7Nov 4, 2026 01:371,556242,786,130229,281,0004,134,00016,793,600
8Nov 4, 2026 01:371,559243,052,935229,572,0004,289,00016,793,600
9Nov 4, 2026 01:371,559243,629,013229,557,0004,299,00016,793,600