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 02:06Victor 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 02:071,656257,604,785240,850,0007,679,00016,797,696
2Jun 18, 2026 02:071,656257,540,227240,815,0007,658,00016,797,696
3Jun 18, 2026 02:071,657257,702,610240,849,0007,701,00016,797,696
4Jun 18, 2026 02:071,657257,736,574240,894,0007,696,00016,797,696
5Jun 18, 2026 02:071,658258,014,315241,026,0007,743,00016,797,696
6Jun 18, 2026 02:071,658257,803,380240,867,0007,859,00016,797,696
7Jun 18, 2026 02:071,663258,588,456241,680,0007,789,00016,797,696
8Jun 18, 2026 02:071,663258,644,633241,765,0007,722,00016,797,696
9Jun 18, 2026 02:071,664258,682,399241,790,0007,818,00016,797,696