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 19, 2026 04:10Victor MerckléVictor MerckléScore: 1,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 04:111,654257,253,780240,363,0007,845,00016,797,696
2Jun 19, 2026 04:111,654257,306,188240,348,0007,872,00016,797,696
3Jun 19, 2026 04:111,655257,593,775240,401,0007,982,00016,797,696
4Jun 19, 2026 04:111,656257,546,233240,460,0007,956,00016,797,696
5Jun 19, 2026 04:111,656257,656,198240,569,0007,916,00016,797,696
6Jun 19, 2026 04:111,656257,668,436240,516,0007,991,00016,797,696
7Jun 19, 2026 04:111,661258,345,752241,225,0007,954,00016,797,696
8Jun 19, 2026 04:111,662258,419,920241,309,0008,006,00016,797,696
9Jun 19, 2026 04:111,662258,558,936241,336,0008,020,00016,797,696