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:05Victor MerckléVictor MerckléScore: 1,657Success
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:061,655257,438,578240,554,0007,810,00016,797,696
2Jun 19, 2026 04:061,656257,933,242240,696,0007,825,00016,797,696
3Jun 19, 2026 04:061,656257,690,577240,623,0007,918,00016,797,696
4Jun 19, 2026 04:061,656257,834,361240,703,0007,842,00016,797,696
5Jun 19, 2026 04:061,657257,753,595240,837,0007,834,00016,797,696
6Jun 19, 2026 04:061,657257,777,251240,779,0007,911,00016,797,696
7Jun 19, 2026 04:061,661258,324,614241,329,0007,934,00016,797,696
8Jun 19, 2026 04:061,661258,443,507241,303,0007,968,00016,797,696
9Jun 19, 2026 04:061,661258,431,413241,413,0007,886,00016,797,696