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 17:47anboto1anboto1Score: 2,779Success
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 17:482,775426,461,573401,792,00014,525,00016,793,600
2Jul 29, 2026 17:482,777426,630,710401,942,00014,673,00016,793,600
3Jul 29, 2026 17:482,777426,628,364401,863,00014,746,00016,793,600
4Jul 29, 2026 17:482,778426,775,021402,236,00014,613,00016,793,600
5Jul 29, 2026 17:482,779426,966,481402,414,00014,503,00016,793,600
6Jul 29, 2026 17:482,780427,166,165402,420,00014,629,00016,793,600
7Jul 29, 2026 17:482,780427,101,950402,562,00014,585,00016,793,600
8Jul 29, 2026 17:482,781427,240,869402,517,00014,635,00016,793,600
9Jul 29, 2026 17:482,785428,511,373403,141,00014,740,00016,793,600