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 12:48Victor MerckléVictor MerckléScore: 1,739Success
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 12:491,737269,789,722252,979,0007,630,00016,797,696
2Jun 7, 2026 12:491,737269,795,953253,021,0007,655,00016,797,696
3Jun 7, 2026 12:491,737269,711,237252,987,0007,592,00016,797,696
4Jun 7, 2026 12:491,739270,043,765253,133,0007,744,00016,797,696
5Jun 7, 2026 12:491,739270,119,085253,216,0007,710,00016,797,696
6Jun 7, 2026 12:491,739270,107,198253,173,0007,698,00016,797,696
7Jun 7, 2026 12:491,743270,768,803253,806,0007,724,00016,797,696
8Jun 7, 2026 12:491,743270,804,865253,800,0007,764,00016,797,696
9Jun 7, 2026 12:491,745270,944,178254,079,0007,752,00016,797,696