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 listJul 29, 2026 22:41anboto1anboto1Score: 3,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 22:423,342511,423,421476,147,00025,243,00016,793,600
2Jul 29, 2026 22:423,347512,189,031476,631,00025,535,00016,793,600
3Jul 29, 2026 22:423,353513,048,444477,547,00025,424,00016,793,600
4Jul 29, 2026 22:423,364514,552,487479,405,00025,233,00016,793,600
5Jul 29, 2026 22:423,368515,229,451479,481,00025,789,00016,793,600
6Jul 29, 2026 22:423,373516,113,784480,285,00025,798,00016,793,600
7Jul 29, 2026 22:423,374516,126,356480,769,00025,475,00016,793,600
8Jul 29, 2026 22:423,388518,235,881482,293,00025,922,00016,793,600
9Jul 29, 2026 22:423,391518,670,217482,165,00026,506,00016,793,600