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 17, 2026 16:51Victor MerckléVictor MerckléScore: 1,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:521,657257,730,831240,901,0007,731,00016,797,696
2Jun 17, 2026 16:521,657257,791,844241,009,0007,661,00016,797,696
3Jun 17, 2026 16:521,657257,738,274240,995,0007,671,00016,797,696
4Jun 17, 2026 16:521,658257,887,914241,145,0007,671,00016,797,696
5Jun 17, 2026 16:521,658257,812,107241,068,0007,672,00016,797,696
6Jun 17, 2026 16:521,658257,865,891240,943,0007,811,00016,797,696
7Jun 17, 2026 16:521,662258,550,669241,702,0007,730,00016,797,696
8Jun 17, 2026 16:521,663258,765,844241,820,0007,742,00016,797,696
9Jun 17, 2026 16:521,664258,801,781241,899,0007,761,00016,797,696