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 13, 2026 01:43Victor MerckléVictor MerckléScore: 1,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 01:501,688260,863,768245,736,0007,581,00016,797,696
2Jun 13, 2026 01:501,689261,162,460245,850,0007,634,00016,797,696
3Jun 13, 2026 01:501,689260,987,358245,621,0007,735,00016,797,696
4Jun 13, 2026 01:501,689261,035,748245,792,0007,631,00016,797,696
5Jun 13, 2026 01:501,690261,188,864245,887,0007,707,00016,797,696
6Jun 13, 2026 01:501,690261,098,212245,916,0007,602,00016,797,696
7Jun 13, 2026 01:501,692265,521,158246,294,0007,627,00016,797,696
8Jun 13, 2026 01:501,694266,401,845246,499,0007,695,00016,797,696
9Jun 13, 2026 01:501,695261,823,328246,582,0007,685,00016,797,696