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:13Victor MerckléVictor MerckléScore: 1,656Success
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:141,653257,098,876240,196,0007,836,00016,797,696
2Jun 18, 2026 20:141,654257,261,252240,270,0007,838,00016,797,696
3Jun 18, 2026 20:141,655257,359,354240,401,0007,868,00016,797,696
4Jun 18, 2026 20:141,655257,494,483240,441,0007,933,00016,797,696
5Jun 18, 2026 20:141,656257,647,172240,514,0007,973,00016,797,696
6Jun 18, 2026 20:141,657257,684,972240,472,0008,128,00016,797,696
7Jun 18, 2026 20:141,660258,191,717241,116,0007,900,00016,797,696
8Jun 18, 2026 20:141,660261,236,245241,113,0007,922,00016,797,696
9Jun 18, 2026 20:141,660258,229,370241,188,0007,941,00016,797,696