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 13, 2026 02:19Victor MerckléVictor MerckléScore: 1,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 02:221,685261,868,976244,439,0008,392,00016,809,984
2Jun 13, 2026 02:221,685261,864,988244,425,0008,422,00016,814,080
3Jun 13, 2026 02:221,685261,962,930243,547,0009,323,00016,936,960
4Jun 13, 2026 02:221,686261,985,368244,587,0008,336,00016,809,984
5Jun 13, 2026 02:221,686262,027,578244,598,0008,389,00016,809,984
6Jun 13, 2026 02:221,687262,079,608244,817,0008,373,00016,809,984
7Jun 13, 2026 02:221,690262,664,380245,169,0008,384,00016,809,984
8Jun 13, 2026 02:221,691262,642,337245,319,0008,378,00016,809,984
9Jun 13, 2026 02:221,692264,665,231245,277,0008,615,00016,809,984