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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 12:571,653257,169,365240,144,0007,881,00016,797,696
2Jun 19, 2026 12:571,655257,560,199240,330,0007,986,00016,797,696
3Jun 19, 2026 12:571,655257,413,946240,330,0007,941,00016,797,696
4Jun 19, 2026 12:571,655257,479,208240,223,0008,147,00016,797,696
5Jun 19, 2026 12:571,655257,388,487240,361,0007,945,00016,797,696
6Jun 19, 2026 12:571,655258,464,843240,353,0007,939,00016,797,696
7Jun 19, 2026 12:571,658258,006,509240,906,0007,913,00016,797,696
8Jun 19, 2026 12:571,659258,122,592240,987,0007,995,00016,797,696
9Jun 19, 2026 12:571,660258,279,815241,059,0007,943,00016,797,696