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 18, 2026 12:24Victor MerckléVictor MerckléScore: 1,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:251,657257,763,437240,853,0007,812,00016,797,696
2Jun 18, 2026 12:251,659258,022,489241,019,0007,904,00016,797,696
3Jun 18, 2026 12:251,659258,123,878240,996,0007,957,00016,797,696
4Jun 18, 2026 12:251,659258,040,151241,033,0007,897,00016,797,696
5Jun 18, 2026 12:251,661258,382,040241,067,0008,132,00016,797,696
6Jun 18, 2026 12:251,663258,667,419241,593,0007,938,00016,797,696
7Jun 18, 2026 12:251,663258,679,673241,480,0008,006,00016,797,696
8Jun 18, 2026 12:251,663258,613,336241,595,0007,895,00016,797,696
9Jun 18, 2026 12:251,666259,141,329242,041,0008,000,00016,797,696