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 20:33Victor MerckléVictor MerckléScore: 1,657Success
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 20:341,655257,447,036240,362,0007,918,00016,797,696
2Jun 18, 2026 20:341,655257,488,027240,505,0007,825,00016,797,696
3Jun 18, 2026 20:341,655257,419,671240,500,0007,846,00016,797,696
4Jun 18, 2026 20:341,657258,243,437240,720,0007,967,00016,797,696
5Jun 18, 2026 20:341,657257,633,551240,620,0007,939,00016,797,696
6Jun 18, 2026 20:341,657257,672,508240,687,0007,909,00016,797,696
7Jun 18, 2026 20:341,661258,381,890241,351,0007,928,00016,797,696
8Jun 18, 2026 20:341,661258,403,518241,253,0007,955,00016,797,696
9Jun 18, 2026 20:341,664258,708,497241,550,0008,078,00016,797,696