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:44anboto1anboto1Score: 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:442,867440,198,217416,670,00013,382,00016,793,600
2Jul 29, 2026 22:442,868440,355,582416,807,00013,397,00016,793,600
3Jul 29, 2026 22:442,868440,295,364416,881,00013,416,00016,793,600
4Jul 29, 2026 22:442,868440,253,079416,941,00013,377,00016,793,600
5Jul 29, 2026 22:442,868440,051,924416,828,00013,386,00016,793,600
6Jul 29, 2026 22:442,869440,553,216417,026,00013,412,00016,793,600
7Jul 29, 2026 22:442,871440,866,450417,328,00013,449,00016,793,600
8Jul 29, 2026 22:442,874441,019,138417,600,00013,508,00016,793,600
9Jul 29, 2026 22:442,891451,700,927420,019,00013,709,00016,793,600