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:31anboto1anboto1Score: 2,905Success
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:322,901445,221,895426,627,0008,667,00016,793,600
2Jul 29, 2026 17:322,901445,259,404426,587,0008,696,00016,793,600
3Jul 29, 2026 17:322,904445,795,582426,983,0008,700,00016,793,600
4Jul 29, 2026 17:322,904445,601,046426,927,0008,678,00016,793,600
5Jul 29, 2026 17:322,905445,783,292426,971,0008,779,00016,793,600
6Jul 29, 2026 17:322,907446,182,146427,410,0008,760,00016,793,600
7Jul 29, 2026 17:322,907446,307,266427,448,0008,720,00016,793,600
8Jul 29, 2026 17:322,908446,453,363427,530,0008,810,00016,793,600
9Jul 29, 2026 17:322,909446,496,417427,742,0008,710,00016,793,600