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:03Victor 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:041,654257,393,298240,354,0007,849,00016,797,696
2Jun 18, 2026 20:041,655257,486,147240,468,0007,896,00016,797,696
3Jun 18, 2026 20:041,655257,517,198240,563,0007,833,00016,797,696
4Jun 18, 2026 20:041,656257,510,650240,558,0007,868,00016,797,696
5Jun 18, 2026 20:041,657257,734,356240,761,0007,873,00016,797,696
6Jun 18, 2026 20:041,657257,779,129240,599,0007,969,00016,797,696
7Jun 18, 2026 20:041,661258,355,159241,258,0007,958,00016,797,696
8Jun 18, 2026 20:041,661258,355,779241,213,0007,971,00016,797,696
9Jun 18, 2026 20:041,662258,522,036241,401,0008,046,00016,797,696