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 listSep 21, 2026 17:48Andrew EpsteinAndrew EpsteinScore: 1,587Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:491,574246,119,316231,763,0004,381,00016,793,600
2Sep 21, 2026 17:491,576245,043,464232,185,0004,227,00016,793,600
3Sep 21, 2026 17:491,577245,215,406232,228,0004,363,00016,793,600
4Sep 21, 2026 17:491,580245,715,834232,952,0004,129,00016,793,600
5Sep 21, 2026 17:491,587255,837,398233,949,0004,240,00016,793,600
6Sep 21, 2026 17:491,610259,223,937237,247,0004,294,00016,793,600
7Sep 21, 2026 17:491,616259,358,576238,242,0004,170,00016,793,600
8Sep 21, 2026 17:491,618260,184,007238,641,0004,162,00016,793,600
9Sep 21, 2026 17:491,620257,000,338238,844,0004,217,00016,793,600