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 15:51anboto1anboto1Score: 3,439Success
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 15:513,418522,727,244472,362,00040,390,00016,793,600
2Jul 29, 2026 15:513,425524,446,725472,951,00040,838,00016,793,600
3Jul 29, 2026 15:513,426523,956,640473,400,00040,552,00016,793,600
4Jul 29, 2026 15:513,431524,688,968474,197,00040,515,00016,793,600
5Jul 29, 2026 15:513,439526,011,312474,340,00041,532,00016,793,600
6Jul 29, 2026 15:513,454528,100,174476,657,00041,590,00016,793,600
7Jul 29, 2026 15:513,463529,440,121478,352,00041,131,00016,793,600
8Jul 29, 2026 15:513,476531,367,476480,622,00040,784,00016,793,600
9Jul 29, 2026 15:513,485532,946,194481,646,00041,191,00016,793,600