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 24, 2026 13:44anboto1anboto1Score: 3,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 13:453,161483,460,427448,964,00025,219,00016,793,600
2Jun 24, 2026 13:453,161483,384,460449,094,00025,073,00016,793,600
3Jun 24, 2026 13:453,164483,822,324449,059,00025,567,00016,793,600
4Jun 24, 2026 13:453,165484,121,478448,642,00026,232,00016,793,600
5Jun 24, 2026 13:453,168484,383,214448,740,00026,475,00016,793,600
6Jun 24, 2026 13:453,168484,411,251450,029,00025,269,00016,793,600
7Jun 24, 2026 13:453,170484,582,727449,313,00026,252,00016,793,600
8Jun 24, 2026 13:453,170484,835,430450,527,00025,108,00016,793,600
9Jun 24, 2026 13:453,174485,353,418449,480,00026,633,00016,793,600