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 21:07anboto1anboto1Score: 3,840Success
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 21:073,834585,193,444550,138,00025,101,00016,793,600
2Jul 29, 2026 21:073,835585,324,773550,004,00025,319,00016,793,600
3Jul 29, 2026 21:073,836585,659,936550,410,00025,126,00016,793,600
4Jul 29, 2026 21:073,837586,793,580550,273,00025,334,00016,793,600
5Jul 29, 2026 21:073,840586,045,784550,711,00025,376,00016,793,600
6Jul 29, 2026 21:073,842586,438,354551,164,00025,265,00016,793,600
7Jul 29, 2026 21:073,842586,556,141551,002,00025,409,00016,793,600
8Jul 29, 2026 21:073,846586,841,263551,515,00025,461,00016,793,600
9Jul 29, 2026 21:073,848587,913,310551,835,00025,455,00016,793,600