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:50Andrew EpsteinAndrew EpsteinScore: 1,576Success
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:541,574246,631,304231,926,0004,310,00016,793,600
2Sep 21, 2026 17:541,574246,663,664231,905,0004,325,00016,793,600
3Sep 21, 2026 17:541,574247,025,395231,910,0004,307,00016,793,600
4Sep 21, 2026 17:541,576247,326,838232,198,0004,268,00016,793,600
5Sep 21, 2026 17:541,576245,884,615232,229,0004,284,00016,793,600
6Sep 21, 2026 17:541,577246,659,219232,556,0004,112,00016,793,600
7Sep 21, 2026 17:541,577246,526,628232,330,0004,268,00016,793,600
8Sep 21, 2026 17:541,578247,236,319232,564,0004,172,00016,793,600
9Sep 21, 2026 17:541,578247,641,957232,440,0004,298,00016,793,600