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:55Andrew EpsteinAndrew EpsteinScore: 1,543Success
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:551,540240,386,578227,049,0004,099,00016,793,600
2Nov 4, 2026 02:551,542240,534,993227,028,0004,297,00016,793,600
3Nov 4, 2026 02:551,543241,235,350227,247,0004,280,00016,793,600
4Nov 4, 2026 02:551,543241,249,464227,126,0004,351,00016,793,600
5Nov 4, 2026 02:551,543241,194,921227,188,0004,327,00016,793,600
6Nov 4, 2026 02:551,544241,399,437227,548,0004,129,00016,793,600
7Nov 4, 2026 02:551,545241,462,357227,623,0004,242,00016,793,600
8Nov 4, 2026 02:551,546241,101,426227,599,0004,337,00016,793,600
9Nov 4, 2026 02:551,546241,645,081227,760,0004,199,00016,793,600