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:21anboto1anboto1Score: 3,693Success
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:223,651557,553,254525,223,00022,463,00016,793,600
2Jul 29, 2026 22:223,656558,611,491526,125,00022,359,00016,793,600
3Jul 29, 2026 22:223,664559,647,637527,624,00022,051,00016,793,600
4Jul 29, 2026 22:223,665559,800,444527,526,00022,285,00016,793,600
5Jul 29, 2026 22:223,693563,942,810531,826,00022,144,00016,793,600
6Jul 29, 2026 22:223,694564,189,801532,254,00021,974,00016,793,600
7Jul 29, 2026 22:223,694564,185,486531,708,00022,469,00016,793,600
8Jul 29, 2026 22:223,735572,216,559537,789,00022,514,00016,793,600
9Jul 29, 2026 22:223,939609,279,613568,442,00022,455,00016,793,600