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:47anboto1anboto1Score: 2,868Success
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:482,867440,198,300416,901,00013,235,00016,793,600
2Jul 29, 2026 22:482,867441,410,295417,049,00013,025,00016,793,600
3Jul 29, 2026 22:482,867440,174,022416,980,00013,212,00016,793,600
4Jul 29, 2026 22:482,867440,433,520416,912,00013,200,00016,793,600
5Jul 29, 2026 22:482,868440,815,496417,015,00013,237,00016,793,600
6Jul 29, 2026 22:482,868440,237,032417,101,00013,185,00016,793,600
7Jul 29, 2026 22:482,872440,861,202417,667,00013,249,00016,793,600
8Jul 29, 2026 22:482,873441,040,288417,780,00013,199,00016,793,600
9Jul 29, 2026 22:482,878441,831,285418,346,00013,493,00016,793,600