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 12:34Victor MerckléVictor MerckléScore: 1,653Success
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 12:351,651256,855,727239,879,0007,884,00016,797,696
2Jun 18, 2026 12:351,652256,984,859240,058,0007,856,00016,797,696
3Jun 18, 2026 12:351,652256,922,405239,965,0007,846,00016,797,696
4Jun 18, 2026 12:351,653257,090,127239,992,0007,967,00016,797,696
5Jun 18, 2026 12:351,653257,142,132239,915,0008,097,00016,797,696
6Jun 18, 2026 12:351,654257,289,148239,962,0008,165,00016,797,696
7Jun 18, 2026 12:351,657257,803,498240,696,0007,913,00016,797,696
8Jun 18, 2026 12:351,658257,888,664240,767,0007,971,00016,797,696
9Jun 18, 2026 12:351,659257,955,365240,945,0007,974,00016,797,696