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 12, 2026 07:57Victor MerckléVictor MerckléScore: 1,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:581,672260,572,724243,229,0007,698,00016,797,696
2Jun 12, 2026 07:581,673260,017,337243,300,0007,674,00016,797,696
3Jun 12, 2026 07:581,673260,804,687243,226,0007,872,00016,797,696
4Jun 12, 2026 07:581,674260,803,369243,469,0007,724,00016,797,696
5Jun 12, 2026 07:581,674260,843,123243,398,0007,810,00016,797,696
6Jun 12, 2026 07:581,675261,120,637243,556,0007,752,00016,797,696
7Jun 12, 2026 07:581,679261,222,854244,185,0007,778,00016,797,696
8Jun 12, 2026 07:581,679261,678,372244,173,0007,806,00016,797,696
9Jun 12, 2026 07:581,681261,506,660244,423,0007,842,00016,797,696