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 12, 2026 06:01Victor MerckléVictor MerckléScore: 1,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:021,706265,119,289248,345,0007,679,00016,797,696
2Jun 12, 2026 06:021,706265,490,809248,201,0007,811,00016,797,696
3Jun 12, 2026 06:021,707265,206,612248,364,0007,712,00016,797,696
4Jun 12, 2026 06:021,707265,331,348248,450,0007,724,00016,797,696
5Jun 12, 2026 06:021,708265,323,437248,470,0007,742,00016,797,696
6Jun 12, 2026 06:021,708266,407,792248,472,0007,766,00016,797,696
7Jun 12, 2026 06:021,712265,959,408249,117,0007,792,00016,797,696
8Jun 12, 2026 06:021,713266,176,529249,163,0007,844,00016,797,696
9Jun 12, 2026 06:021,713266,077,608249,191,0007,790,00016,797,696