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 13, 2026 16:06Victor MerckléVictor MerckléScore: 1,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 16:081,693261,705,426245,428,0008,628,00016,818,176
2Jun 13, 2026 16:081,693261,823,919245,360,0008,699,00016,818,176
3Jun 13, 2026 16:081,693263,255,010245,489,0008,596,00016,818,176
4Jun 13, 2026 16:081,693263,695,973244,432,0009,546,00016,818,176
5Jun 13, 2026 16:081,694261,943,406245,600,0008,557,00016,818,176
6Jun 13, 2026 16:081,694263,215,978245,602,0008,642,00016,818,176
7Jun 13, 2026 16:081,697263,653,525246,080,0008,602,00016,818,176
8Jun 13, 2026 16:081,700264,046,131246,359,0008,695,00016,818,176
9Jun 13, 2026 16:081,701264,236,969246,499,0008,664,00016,818,176