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 14:50Victor MerckléVictor MerckléScore: 1,666Success
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 14:511,664259,049,812242,015,0007,724,00016,797,696
2Jun 17, 2026 14:511,664258,996,040242,044,0007,612,00016,797,696
3Jun 17, 2026 14:511,665259,366,080242,054,0007,806,00016,797,696
4Jun 17, 2026 14:511,666259,415,287242,259,0007,782,00016,797,696
5Jun 17, 2026 14:511,666259,277,074242,235,0007,715,00016,797,696
6Jun 17, 2026 14:511,667259,639,375242,365,0007,805,00016,797,696
7Jun 17, 2026 14:511,670259,961,771242,823,0007,735,00016,797,696
8Jun 17, 2026 14:511,671260,074,525242,947,0007,787,00016,797,696
9Jun 17, 2026 14:511,673260,181,395243,257,0007,758,00016,797,696