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 18, 2026 12:09Victor MerckléVictor MerckléScore: 1,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:101,655257,530,320240,546,0007,850,00016,797,696
2Jun 18, 2026 12:101,655257,440,537240,530,0007,817,00016,797,696
3Jun 18, 2026 12:101,656257,496,748240,593,0007,811,00016,797,696
4Jun 18, 2026 12:101,657257,674,455240,663,0007,895,00016,797,696
5Jun 18, 2026 12:101,659258,130,824241,085,0007,890,00016,797,696
6Jun 18, 2026 12:101,661258,427,042241,225,0008,037,00016,797,696
7Jun 18, 2026 12:101,663258,849,535241,594,0008,002,00016,797,696
8Jun 18, 2026 12:101,663258,662,022241,541,0007,927,00016,797,696
9Jun 18, 2026 12:101,664258,788,615241,632,0007,979,00016,797,696