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 12, 2026 07:27Victor MerckléVictor MerckléScore: 1,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:281,696263,584,892246,653,0007,802,00016,797,696
2Jun 12, 2026 07:281,697263,669,102246,896,0007,691,00016,797,696
3Jun 12, 2026 07:281,697263,789,244246,861,0007,769,00016,797,696
4Jun 12, 2026 07:281,697263,710,554246,870,0007,733,00016,797,696
5Jun 12, 2026 07:281,698264,314,538246,900,0007,932,00016,797,696
6Jun 12, 2026 07:281,698263,934,273247,024,0007,751,00016,797,696
7Jun 12, 2026 07:281,701264,450,560247,385,0007,881,00016,797,696
8Jun 12, 2026 07:281,702264,497,124247,594,0007,723,00016,797,696
9Jun 12, 2026 07:281,702264,535,465247,416,0007,900,00016,797,696