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 19:48Victor MerckléVictor MerckléScore: 1,652Success
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 19:491,650256,778,832239,746,0007,848,00016,797,696
2Jun 18, 2026 19:491,651256,811,667239,842,0007,856,00016,797,696
3Jun 18, 2026 19:491,651256,841,636239,967,0007,783,00016,797,696
4Jun 18, 2026 19:491,652256,923,680239,987,0007,825,00016,797,696
5Jun 18, 2026 19:491,652256,976,033240,024,0007,900,00016,797,696
6Jun 18, 2026 19:491,652256,948,998239,959,0007,889,00016,797,696
7Jun 18, 2026 19:491,657257,814,571240,751,0007,939,00016,797,696
8Jun 18, 2026 19:491,659258,076,997240,796,0008,150,00016,797,696
9Jun 18, 2026 19:491,659258,347,856240,863,0008,023,00016,797,696