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 18, 2026 12:19Victor MerckléVictor MerckléScore: 1,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:201,656257,650,575240,548,0007,963,00016,797,696
2Jun 18, 2026 12:201,656257,679,354240,722,0007,815,00016,797,696
3Jun 18, 2026 12:201,657257,725,103240,762,0007,871,00016,797,696
4Jun 18, 2026 12:201,657257,833,654240,750,0007,898,00016,797,696
5Jun 18, 2026 12:201,658257,894,577240,783,0007,950,00016,797,696
6Jun 18, 2026 12:201,660258,164,822241,078,0007,928,00016,797,696
7Jun 18, 2026 12:201,663260,276,251241,525,0008,000,00016,797,696
8Jun 18, 2026 12:201,663258,656,370241,564,0008,004,00016,797,696
9Jun 18, 2026 12:201,664258,849,819241,709,0008,026,00016,797,696