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 15:51Victor MerckléVictor MerckléScore: 1,694Success
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 15:531,691262,788,453245,162,0008,498,00016,818,176
2Jun 13, 2026 15:531,692261,576,972245,296,0008,618,00016,818,176
3Jun 13, 2026 15:531,693261,784,057245,390,0008,601,00016,818,176
4Jun 13, 2026 15:531,694262,943,896245,572,0008,531,00016,818,176
5Jun 13, 2026 15:531,694263,202,087245,453,0008,675,00016,818,176
6Jun 13, 2026 15:531,695261,882,582245,561,0008,768,00016,818,176
7Jun 13, 2026 15:531,697262,340,280246,155,0008,532,00016,818,176
8Jun 13, 2026 15:531,699263,766,839246,346,0008,585,00016,818,176
9Jun 13, 2026 15:531,701263,620,919246,499,0008,656,00016,818,176