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 24, 2026 10:25anboto1anboto1Score: 4,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:254,677710,783,274676,163,00025,410,00016,793,600
2Jun 24, 2026 10:254,677710,907,758676,239,00025,367,00016,793,600
3Jun 24, 2026 10:254,678711,064,527676,508,00025,288,00016,793,600
4Jun 24, 2026 10:254,686712,253,545677,368,00025,658,00016,793,600
5Jun 24, 2026 10:254,687712,174,650676,875,00026,189,00016,793,600
6Jun 24, 2026 10:254,688712,362,645677,009,00026,244,00016,793,600
7Jun 24, 2026 10:254,688712,369,898677,596,00025,682,00016,793,600
8Jun 24, 2026 10:254,697714,343,960678,857,00025,841,00016,793,600
9Jun 24, 2026 10:254,723717,734,553683,513,00024,999,00016,793,600