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 14:51anboto1anboto1Score: 3,009Success
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 14:513,004459,933,246438,804,00011,886,00016,793,600
2Jun 24, 2026 14:513,005459,962,385438,964,00011,862,00016,793,600
3Jun 24, 2026 14:513,006460,047,003439,182,00011,728,00016,793,600
4Jun 24, 2026 14:513,006460,179,288438,835,00012,111,00016,793,600
5Jun 24, 2026 14:513,009460,826,704439,513,00011,960,00016,793,600
6Jun 24, 2026 14:513,010460,771,795440,261,00011,323,00016,793,600
7Jun 24, 2026 14:513,012461,091,020439,923,00011,954,00016,793,600
8Jun 24, 2026 14:513,013461,150,112439,636,00012,385,00016,793,600
9Jun 24, 2026 14:513,016461,674,732440,311,00012,211,00016,793,600