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:56Victor 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 17, 2026 16:571,657257,803,764240,895,0007,708,00016,797,696
2Jun 17, 2026 16:571,657257,856,090240,983,0007,694,00016,797,696
3Jun 17, 2026 16:571,657257,771,077240,914,0007,682,00016,797,696
4Jun 17, 2026 16:571,658257,928,064241,166,0007,632,00016,797,696
5Jun 17, 2026 16:571,659258,155,541241,095,0007,817,00016,797,696
6Jun 17, 2026 16:571,660258,388,114241,354,0007,767,00016,797,696
7Jun 17, 2026 16:571,664258,907,294241,918,0007,808,00016,797,696
8Jun 17, 2026 16:571,664258,692,567241,852,0007,750,00016,797,696
9Jun 17, 2026 16:571,664258,842,037241,992,0007,757,00016,797,696