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 16:21Victor MerckléVictor MerckléScore: 1,659Success
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 16:221,658257,919,837241,152,0007,670,00016,797,696
2Jun 17, 2026 16:221,658257,744,287241,104,0007,628,00016,797,696
3Jun 17, 2026 16:221,658257,893,729241,138,0007,692,00016,797,696
4Jun 17, 2026 16:221,658257,867,446240,960,0007,758,00016,797,696
5Jun 17, 2026 16:221,659257,972,047241,148,0007,745,00016,797,696
6Jun 17, 2026 16:221,659257,964,394241,191,0007,735,00016,797,696
7Jun 17, 2026 16:221,664258,719,493241,868,0007,741,00016,797,696
8Jun 17, 2026 16:221,665258,931,325242,066,0007,790,00016,797,696
9Jun 17, 2026 16:221,667259,090,719242,199,0007,856,00016,797,696