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:40Victor MerckléVictor MerckléScore: 1,676Success
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:411,673260,583,673243,311,0007,736,00016,797,696
2Jun 17, 2026 14:411,674260,910,651243,421,0007,717,00016,797,696
3Jun 17, 2026 14:411,674260,722,839243,392,0007,723,00016,797,696
4Jun 17, 2026 14:411,675261,043,339243,424,0007,826,00016,797,696
5Jun 17, 2026 14:411,676261,051,100243,374,0008,075,00016,797,696
6Jun 17, 2026 14:411,677260,600,265243,715,0007,848,00016,797,696
7Jun 17, 2026 14:411,679261,207,722244,237,0007,735,00016,797,696
8Jun 17, 2026 14:411,679261,175,908244,119,0007,756,00016,797,696
9Jun 17, 2026 14:411,680261,240,233244,276,0007,786,00016,797,696