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 listJul 9, 2026 16:48Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 16:491,650257,445,197239,740,0007,817,00016,801,792stderr
2Jul 9, 2026 16:491,650257,469,246239,820,0007,801,00016,801,792stderr
3Jul 9, 2026 16:491,650257,488,442239,793,0007,795,00016,801,792stderr
4Jul 9, 2026 16:491,650257,418,666239,770,0007,791,00016,801,792stderr
5Jul 9, 2026 16:491,650257,442,086239,641,0007,881,00016,801,792stderr
6Jul 9, 2026 16:491,651258,069,820239,791,0007,975,00016,801,792stderr
7Jul 9, 2026 16:491,654258,018,524240,284,0007,951,00016,801,792stderr
8Jul 9, 2026 16:491,656258,435,750240,557,0007,970,00016,801,792stderr
9Jul 9, 2026 16:491,657258,326,863240,693,0007,979,00016,801,792stderr