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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:501,649256,610,340239,642,0007,854,00016,797,696
2Jun 18, 2026 12:501,650256,844,795239,651,0007,872,00016,797,696
3Jun 18, 2026 12:501,650256,773,842239,660,0007,882,00016,797,696
4Jun 18, 2026 12:501,650256,718,946239,725,0007,851,00016,797,696
5Jun 18, 2026 12:501,650256,723,837239,751,0007,853,00016,797,696
6Jun 18, 2026 12:501,651256,948,888239,908,0007,863,00016,797,696
7Jun 18, 2026 12:501,655257,466,509240,342,0007,936,00016,797,696
8Jun 18, 2026 12:501,655257,458,586240,417,0007,954,00016,797,696
9Jun 18, 2026 12:501,656257,546,043240,475,0007,950,00016,797,696