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 12, 2026 05:41Victor MerckléVictor MerckléScore: 1,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 05:421,715266,439,709249,580,0007,764,00016,797,696
2Jun 12, 2026 05:421,716266,916,352249,717,0007,734,00016,797,696
3Jun 12, 2026 05:421,716266,556,394249,714,0007,750,00016,797,696
4Jun 12, 2026 05:421,717266,693,089249,865,0007,721,00016,797,696
5Jun 12, 2026 05:421,718266,902,445249,714,0008,060,00016,797,696
6Jun 12, 2026 05:421,718267,079,944249,800,0008,026,00016,797,696
7Jun 12, 2026 05:421,722267,451,172250,528,0007,782,00016,797,696
8Jun 12, 2026 05:421,722267,451,496250,512,0007,821,00016,797,696
9Jun 12, 2026 05:421,722267,544,480250,532,0007,831,00016,797,696