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 02:17Victor 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 18, 2026 02:181,658257,962,401241,031,0007,814,00016,797,696
2Jun 18, 2026 02:181,659258,020,583241,048,0007,840,00016,797,696
3Jun 18, 2026 02:181,659258,087,794240,981,0007,930,00016,797,696
4Jun 18, 2026 02:181,660258,077,593241,108,0007,893,00016,797,696
5Jun 18, 2026 02:181,661258,421,976241,172,0008,001,00016,797,696
6Jun 18, 2026 02:181,661258,537,188241,271,0007,929,00016,797,696
7Jun 18, 2026 02:181,664258,837,049241,714,0007,952,00016,797,696
8Jun 18, 2026 02:181,665258,890,661241,945,0007,876,00016,797,696
9Jun 18, 2026 02:181,667259,573,728242,023,0008,037,00016,797,696