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:32anboto1anboto1Score: 3,865Success
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:343,852587,891,045562,825,00015,051,00016,793,600
2Jul 29, 2026 22:343,853589,491,956562,996,00015,100,00016,793,600
3Jul 29, 2026 22:343,858588,831,277563,634,00015,191,00016,793,600
4Jul 29, 2026 22:343,862589,519,426564,146,00015,303,00016,793,600
5Jul 29, 2026 22:343,865590,153,847564,627,00015,250,00016,793,600
6Jul 29, 2026 22:343,867590,895,214564,889,00015,257,00016,793,600
7Jul 29, 2026 22:343,868590,292,002565,230,00015,041,00016,793,600
8Jul 29, 2026 22:343,870590,646,557565,457,00015,188,00016,793,600
9Jul 29, 2026 22:343,890595,272,679568,462,00015,182,00016,793,600