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:21Victor MerckléVictor MerckléScore: 1,821Success
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:231,817281,696,910264,773,0007,859,00016,797,696
2Jun 19, 2026 12:231,817281,680,448264,747,0007,891,00016,797,696
3Jun 19, 2026 12:231,818281,874,560264,873,0007,861,00016,797,696
4Jun 19, 2026 12:231,819282,064,584264,766,0008,113,00016,797,696
5Jun 19, 2026 12:231,821282,632,355264,839,0008,453,00016,797,696
6Jun 19, 2026 12:231,821282,303,440265,273,0007,934,00016,797,696
7Jun 19, 2026 12:231,822282,548,134265,422,0008,001,00016,797,696
8Jun 19, 2026 12:231,824282,770,583265,620,0008,069,00016,797,696
9Jun 19, 2026 12:231,824283,008,131264,936,0008,787,00016,797,696