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 15, 2026 14:27Victor MerckléVictor MerckléScore: 1,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 14:281,675259,036,141243,599,0007,732,00016,797,696
2Jun 15, 2026 14:281,676259,254,795243,670,0007,836,00016,797,696
3Jun 15, 2026 14:281,676259,195,073243,778,0007,703,00016,797,696
4Jun 15, 2026 14:281,677259,406,301243,924,0007,695,00016,797,696
5Jun 15, 2026 14:281,677259,317,644243,831,0007,753,00016,797,696
6Jun 15, 2026 14:281,678259,457,805244,003,0007,786,00016,797,696
7Jun 15, 2026 14:281,683260,252,036244,671,0007,856,00016,797,696
8Jun 15, 2026 14:281,684260,184,012244,825,0007,842,00016,797,696
9Jun 15, 2026 14:281,684260,352,084244,859,0007,838,00016,797,696