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:20Victor 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:211,675260,498,415243,743,0007,648,00016,797,696
2Jun 17, 2026 14:211,675260,586,725243,635,0007,661,00016,797,696
3Jun 17, 2026 14:211,675260,431,734243,625,0007,667,00016,797,696
4Jun 17, 2026 14:211,675260,379,536243,654,0007,642,00016,797,696
5Jun 17, 2026 14:211,676260,629,708243,757,0007,659,00016,797,696
6Jun 17, 2026 14:211,677260,924,318243,840,0007,851,00016,797,696
7Jun 17, 2026 14:211,680261,242,043244,395,0007,719,00016,797,696
8Jun 17, 2026 14:211,680261,232,245244,393,0007,719,00016,797,696
9Jun 17, 2026 14:211,682261,494,291244,638,0007,806,00016,797,696