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 7, 2026 13:03Victor MerckléVictor MerckléScore: 1,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 13:041,743270,762,422253,882,0007,695,00016,797,696
2Jun 7, 2026 13:041,744270,871,471253,998,0007,736,00016,797,696
3Jun 7, 2026 13:041,744270,832,990254,024,0007,684,00016,797,696
4Jun 7, 2026 13:041,744270,893,146254,036,0007,702,00016,797,696
5Jun 7, 2026 13:041,744271,199,153253,996,0007,708,00016,797,696
6Jun 7, 2026 13:041,744270,763,247254,018,0007,643,00016,797,696
7Jun 7, 2026 13:041,749271,489,484254,655,0007,733,00016,797,696
8Jun 7, 2026 13:041,750271,628,865254,789,0007,714,00016,797,696
9Jun 7, 2026 13:041,750271,994,068254,869,0007,773,00016,797,696