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 17:01Victor MerckléVictor MerckléScore: 1,667Success
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 17:021,665259,004,152242,204,0007,692,00016,797,696
2Jun 17, 2026 17:021,665258,941,467242,191,0007,696,00016,797,696
3Jun 17, 2026 17:021,665259,002,007242,191,0007,664,00016,797,696
4Jun 17, 2026 17:021,667259,260,522242,358,0007,762,00016,797,696
5Jun 17, 2026 17:021,667259,345,540242,288,0007,903,00016,797,696
6Jun 17, 2026 17:021,667259,225,864242,411,0007,766,00016,797,696
7Jun 17, 2026 17:021,670259,828,842242,842,0007,803,00016,797,696
8Jun 17, 2026 17:021,671259,925,299242,955,0007,824,00016,797,696
9Jun 17, 2026 17:021,673260,110,317243,134,0007,817,00016,797,696