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 17, 2026 15:41Victor MerckléVictor MerckléScore: 1,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:421,670259,933,097242,853,0007,706,00016,797,696
2Jun 17, 2026 15:421,670259,832,663242,806,0007,759,00016,797,696
3Jun 17, 2026 15:421,670259,576,317242,880,0007,634,00016,797,696
4Jun 17, 2026 15:421,670259,708,598242,902,0007,733,00016,797,696
5Jun 17, 2026 15:421,672260,507,951243,095,0007,803,00016,797,696
6Jun 17, 2026 15:421,673260,748,736242,858,0008,115,00016,797,696
7Jun 17, 2026 15:421,674260,352,745243,521,0007,727,00016,797,696
8Jun 17, 2026 15:421,674260,790,287243,386,0007,716,00016,797,696
9Jun 17, 2026 15:421,676261,207,356243,633,0007,864,00016,797,696