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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 12:261,749271,595,364254,837,0007,643,00016,797,696
2Jun 7, 2026 12:261,750271,683,279254,734,0007,783,00016,797,696
3Jun 7, 2026 12:261,750271,703,036254,786,0007,769,00016,797,696
4Jun 7, 2026 12:261,751272,302,587254,904,0007,773,00016,797,696
5Jun 7, 2026 12:261,751272,359,328254,938,0007,746,00016,797,696
6Jun 7, 2026 12:261,751271,962,305254,941,0007,793,00016,797,696
7Jun 7, 2026 12:261,754272,365,219255,589,0007,649,00016,797,696
8Jun 7, 2026 12:261,754272,367,015255,513,0007,732,00016,797,696
9Jun 7, 2026 12:261,755272,645,182255,556,0007,778,00016,797,696