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 18:20anboto1anboto1Score: 2,884Success
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 18:212,875441,208,687422,626,0008,673,00016,793,600
2Jul 29, 2026 18:212,880442,180,677423,223,0008,888,00016,793,600
3Jul 29, 2026 18:212,881442,104,419423,606,0008,582,00016,793,600
4Jul 29, 2026 18:212,882442,404,663423,745,0008,674,00016,793,600
5Jul 29, 2026 18:212,884443,401,763423,873,0008,735,00016,793,600
6Jul 29, 2026 18:212,884442,534,686423,875,0008,734,00016,793,600
7Jul 29, 2026 18:212,884442,637,033423,814,0008,810,00016,793,600
8Jul 29, 2026 18:212,885442,940,445424,115,0008,691,00016,793,600
9Jul 29, 2026 18:212,885442,796,969424,070,0008,716,00016,793,600