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 15:51Victor MerckléVictor MerckléScore: 1,664Success
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 15:521,662258,635,826241,776,0007,659,00016,797,696
2Jun 17, 2026 15:521,663259,123,201241,748,0007,758,00016,797,696
3Jun 17, 2026 15:521,663259,113,247241,720,0007,792,00016,797,696
4Jun 17, 2026 15:521,664258,953,934242,064,0007,685,00016,797,696
5Jun 17, 2026 15:521,664258,752,961241,988,0007,719,00016,797,696
6Jun 17, 2026 15:521,664259,005,783241,929,0007,797,00016,797,696
7Jun 17, 2026 15:521,669259,583,407242,651,0007,784,00016,797,696
8Jun 17, 2026 15:521,670260,325,952242,619,0008,002,00016,797,696
9Jun 17, 2026 15:521,671259,975,431242,976,0007,798,00016,797,696