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 listJun 19, 2026 04:15Victor MerckléVictor MerckléScore: 1,653Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 04:161,652256,977,455240,031,0007,873,00016,797,696
2Jun 19, 2026 04:161,652257,048,522240,112,0007,800,00016,797,696
3Jun 19, 2026 04:161,653257,218,493240,234,0007,831,00016,797,696
4Jun 19, 2026 04:161,653257,061,849240,123,0007,828,00016,797,696
5Jun 19, 2026 04:161,653257,253,013240,118,0007,951,00016,797,696
6Jun 19, 2026 04:161,653257,105,619240,150,0007,895,00016,797,696
7Jun 19, 2026 04:161,658257,800,429240,817,0007,909,00016,797,696
8Jun 19, 2026 04:161,659258,030,104240,932,0007,995,00016,797,696
9Jun 19, 2026 04:161,659257,920,067240,891,0007,973,00016,797,696