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 17, 2026 15:30Victor MerckléVictor MerckléScore: 1,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:311,662258,889,044241,701,0007,676,00016,797,696
2Jun 17, 2026 15:311,662258,691,204241,722,0007,712,00016,797,696
3Jun 17, 2026 15:311,662258,585,185241,721,0007,718,00016,797,696
4Jun 17, 2026 15:311,663258,623,938241,816,0007,731,00016,797,696
5Jun 17, 2026 15:311,664259,640,483242,027,0007,694,00016,797,696
6Jun 17, 2026 15:311,665259,216,240241,823,0008,048,00016,797,696
7Jun 17, 2026 15:311,667259,343,514242,425,0007,761,00016,797,696
8Jun 17, 2026 15:311,668259,884,936242,441,0007,803,00016,797,696
9Jun 17, 2026 15:311,668259,407,039242,434,0007,837,00016,797,696