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 01:21Victor MerckléVictor MerckléScore: 1,689Success
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 01:281,687260,842,861245,578,0007,613,00016,797,696
2Jun 13, 2026 01:281,688260,806,872245,676,0007,539,00016,797,696
3Jun 13, 2026 01:281,688260,864,160245,678,0007,555,00016,797,696
4Jun 13, 2026 01:281,689261,008,979245,729,0007,662,00016,797,696
5Jun 13, 2026 01:281,689260,945,498245,812,0007,607,00016,797,696
6Jun 13, 2026 01:281,689261,265,512245,705,0007,693,00016,797,696
7Jun 13, 2026 01:281,694266,153,180246,479,0007,676,00016,797,696
8Jun 13, 2026 01:281,695261,905,340246,578,0007,681,00016,797,696
9Jun 13, 2026 01:281,695261,853,485246,589,0007,675,00016,797,696