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 07:47Victor MerckléVictor MerckléScore: 1,674Success
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 07:481,672260,587,002243,192,0007,636,00016,797,696
2Jun 12, 2026 07:481,673260,660,406243,327,0007,713,00016,797,696
3Jun 12, 2026 07:481,674260,760,423243,269,0007,934,00016,797,696
4Jun 12, 2026 07:481,674260,526,865243,430,0007,789,00016,797,696
5Jun 12, 2026 07:481,674260,943,705243,529,0007,697,00016,797,696
6Jun 12, 2026 07:481,675260,937,590243,481,0007,780,00016,797,696
7Jun 12, 2026 07:481,678261,014,217244,024,0007,778,00016,797,696
8Jun 12, 2026 07:481,678261,488,285244,091,0007,738,00016,797,696
9Jun 12, 2026 07:481,680261,367,494244,331,0007,784,00016,797,696