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:00Victor MerckléVictor MerckléScore: 1,670Success
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:011,666259,125,699242,389,0007,617,00016,797,696
2Jun 17, 2026 15:011,668259,494,130242,589,0007,733,00016,797,696
3Jun 17, 2026 15:011,669260,633,831242,710,0007,743,00016,797,696
4Jun 17, 2026 15:011,669259,834,317242,486,0007,925,00016,797,696
5Jun 17, 2026 15:011,670260,989,445242,814,0007,733,00016,797,696
6Jun 17, 2026 15:011,670259,968,105242,960,0007,657,00016,797,696
7Jun 17, 2026 15:011,672260,075,014243,073,0007,759,00016,797,696
8Jun 17, 2026 15:011,672260,394,573243,171,0007,747,00016,797,696
9Jun 17, 2026 15:011,675260,736,206243,568,0007,824,00016,797,696