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 8, 2026 13:26Victor MerckléVictor MerckléScore: 1,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 13:271,722267,408,887250,628,0007,675,00016,797,696
2Jun 8, 2026 13:271,722267,576,110250,633,0007,734,00016,797,696
3Jun 8, 2026 13:271,722267,558,627250,682,0007,722,00016,797,696
4Jun 8, 2026 13:271,722267,551,041250,607,0007,779,00016,797,696
5Jun 8, 2026 13:271,723267,646,803250,696,0007,778,00016,797,696
6Jun 8, 2026 13:271,723267,616,333250,756,0007,712,00016,797,696
7Jun 8, 2026 13:271,726268,166,959251,272,0007,651,00016,797,696
8Jun 8, 2026 13:271,727268,255,613251,374,0007,770,00016,797,696
9Jun 8, 2026 13:271,727269,007,550251,394,0007,690,00016,797,696