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:20Victor MerckléVictor MerckléScore: 1,660Success
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:211,657258,043,090240,944,0007,624,00016,797,696
2Jun 17, 2026 15:211,658258,238,659241,170,0007,670,00016,797,696
3Jun 17, 2026 15:211,659258,542,359241,155,0007,708,00016,797,696
4Jun 17, 2026 15:211,659258,422,401241,208,0007,696,00016,797,696
5Jun 17, 2026 15:211,660258,589,143241,264,0007,758,00016,797,696
6Jun 17, 2026 15:211,660258,818,357241,281,0007,724,00016,797,696
7Jun 17, 2026 15:211,663259,094,302241,823,0007,771,00016,797,696
8Jun 17, 2026 15:211,665259,307,422241,973,0007,811,00016,797,696
9Jun 17, 2026 15:211,665260,595,553242,081,0007,788,00016,797,696