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 04:41Victor MerckléVictor MerckléScore: 1,661Success
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 04:421,659257,962,500241,104,0007,784,00016,797,696
2Jun 19, 2026 04:421,660258,127,905241,104,0007,933,00016,797,696
3Jun 19, 2026 04:421,660258,283,276241,234,0007,881,00016,797,696
4Jun 19, 2026 04:421,661258,326,592241,346,0007,837,00016,797,696
5Jun 19, 2026 04:421,661258,372,340241,285,0007,929,00016,797,696
6Jun 19, 2026 04:421,661258,371,548241,249,0007,923,00016,797,696
7Jun 19, 2026 04:421,664258,838,596241,810,0007,897,00016,797,696
8Jun 19, 2026 04:421,665258,964,198241,904,0007,953,00016,797,696
9Jun 19, 2026 04:421,668259,288,708242,250,0007,976,00016,797,696