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 listJul 29, 2026 22:07anboto1anboto1Score: 3,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 22:083,759573,910,124541,486,00022,400,00016,793,600
2Jul 29, 2026 22:083,781577,204,175545,070,00022,104,00016,793,600
3Jul 29, 2026 22:083,793579,186,327546,342,00022,745,00016,793,600
4Jul 29, 2026 22:083,793580,268,297546,764,00022,257,00016,793,600
5Jul 29, 2026 22:083,806580,953,127548,521,00022,406,00016,793,600
6Jul 29, 2026 22:083,806581,065,272548,550,00022,460,00016,793,600
7Jul 29, 2026 22:083,811582,448,998549,420,00022,328,00016,793,600
8Jul 29, 2026 22:083,825583,946,633551,958,00021,930,00016,793,600
9Jul 29, 2026 22:083,858588,703,571556,560,00022,141,00016,793,600