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 14:35Victor MerckléVictor MerckléScore: 1,676Success
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 14:361,673260,854,454243,404,0007,686,00016,797,696
2Jun 17, 2026 14:361,674260,807,348243,462,0007,691,00016,797,696
3Jun 17, 2026 14:361,674261,019,203243,505,0007,718,00016,797,696
4Jun 17, 2026 14:361,675261,138,340243,667,0007,725,00016,797,696
5Jun 17, 2026 14:361,676260,723,552243,706,0007,831,00016,797,696
6Jun 17, 2026 14:361,676260,733,806243,614,0007,793,00016,797,696
7Jun 17, 2026 14:361,679261,446,168244,287,0007,707,00016,797,696
8Jun 17, 2026 14:361,680261,677,797244,298,0007,757,00016,797,696
9Jun 17, 2026 14:361,681261,468,685244,383,0007,807,00016,797,696