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:12Victor MerckléVictor MerckléScore: 1,668Success
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:131,666259,208,490241,657,0008,358,00016,797,696
2Jun 18, 2026 02:131,666259,180,204241,686,0008,294,00016,797,696
3Jun 18, 2026 02:131,667259,281,143241,721,0008,394,00016,797,696
4Jun 18, 2026 02:131,667259,329,829241,792,0008,386,00016,797,696
5Jun 18, 2026 02:131,668259,483,163241,825,0008,411,00016,797,696
6Jun 18, 2026 02:131,670259,802,138242,171,0008,435,00016,797,696
7Jun 18, 2026 02:131,674260,424,804242,646,0008,597,00016,797,696
8Jun 18, 2026 02:131,674260,212,481242,604,0008,498,00016,797,696
9Jun 18, 2026 02:131,674260,469,826242,645,0008,579,00016,797,696