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 18:32anboto1anboto1Score: 2,801Success
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 18:332,793428,919,687405,842,00013,142,00016,793,600
2Jul 29, 2026 18:332,795429,295,846406,199,00013,082,00016,793,600
3Jul 29, 2026 18:332,799429,970,980406,836,00013,150,00016,793,600
4Jul 29, 2026 18:332,800430,056,717406,908,00013,142,00016,793,600
5Jul 29, 2026 18:332,801430,174,878406,959,00013,206,00016,793,600
6Jul 29, 2026 18:332,806431,082,973407,578,00013,403,00016,793,600
7Jul 29, 2026 18:332,812431,951,567408,606,00013,296,00016,793,600
8Jul 29, 2026 18:332,818432,769,003409,449,00013,256,00016,793,600
9Jul 29, 2026 18:332,820433,134,812409,964,00013,149,00016,793,600