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 17, 2026 15:15Victor MerckléVictor MerckléScore: 1,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:161,663258,998,793241,873,0007,683,00016,797,696
2Jun 17, 2026 15:161,664259,336,323241,821,0007,915,00016,797,696
3Jun 17, 2026 15:161,664258,846,823241,814,0007,869,00016,797,696
4Jun 17, 2026 15:161,664259,014,964241,900,0007,833,00016,797,696
5Jun 17, 2026 15:161,664259,105,995241,973,0007,742,00016,797,696
6Jun 17, 2026 15:161,666259,122,088242,208,0007,796,00016,797,696
7Jun 17, 2026 15:161,668259,879,689242,544,0007,720,00016,797,696
8Jun 17, 2026 15:161,669259,518,262242,580,0007,771,00016,797,696
9Jun 17, 2026 15:161,673260,357,739243,222,0007,742,00016,797,696