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 12, 2026 06:52Victor MerckléVictor MerckléScore: 1,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:531,692262,938,809246,194,0007,668,00016,797,696
2Jun 12, 2026 06:531,692263,032,721246,119,0007,723,00016,797,696
3Jun 12, 2026 06:531,694263,325,334246,423,0007,799,00016,797,696
4Jun 12, 2026 06:531,694263,215,452246,365,0007,766,00016,797,696
5Jun 12, 2026 06:531,695263,467,415246,414,0007,881,00016,797,696
6Jun 12, 2026 06:531,695263,424,102246,545,0007,730,00016,797,696
7Jun 12, 2026 06:531,697263,681,546246,891,0007,743,00016,797,696
8Jun 12, 2026 06:531,699264,484,900247,187,0007,812,00016,797,696
9Jun 12, 2026 06:531,699263,902,257247,047,0007,806,00016,797,696