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 14:45Victor MerckléVictor MerckléScore: 1,673Success
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 14:461,671259,957,258243,080,0007,709,00016,797,696
2Jun 17, 2026 14:461,671259,970,394243,100,0007,685,00016,797,696
3Jun 17, 2026 14:461,672260,252,450243,168,0007,717,00016,797,696
4Jun 17, 2026 14:461,672260,086,142243,115,0007,761,00016,797,696
5Jun 17, 2026 14:461,673260,239,082243,103,0007,952,00016,797,696
6Jun 17, 2026 14:461,673260,279,193243,300,0007,774,00016,797,696
7Jun 17, 2026 14:461,676260,609,153243,786,0007,730,00016,797,696
8Jun 17, 2026 14:461,676260,562,821243,735,0007,738,00016,797,696
9Jun 17, 2026 14:461,679261,133,242244,136,0007,817,00016,797,696