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 15:59Andrew EpsteinAndrew EpsteinScore: 1,650Success
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 15:591,647257,686,833242,879,0004,266,00016,793,600
2Sep 21, 2026 15:591,647257,648,094242,863,0004,229,00016,793,600
3Sep 21, 2026 15:591,648257,610,880242,048,0005,184,00016,793,600
4Sep 21, 2026 15:591,650258,120,367243,206,0004,376,00016,793,600
5Sep 21, 2026 15:591,650258,046,939243,246,0004,332,00016,793,600
6Sep 21, 2026 15:591,650257,956,669243,288,0004,239,00016,793,600
7Sep 21, 2026 15:591,653259,276,409243,680,0004,391,00016,793,600
8Sep 21, 2026 15:591,653258,386,450243,744,0004,222,00016,793,600
9Sep 21, 2026 15:591,655259,507,105243,154,0005,152,00016,793,600