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 15:22anboto1anboto1Score: 3,012Success
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 15:233,005460,152,962439,046,00011,787,00016,793,600
2Jun 24, 2026 15:233,006460,058,893438,949,00011,991,00016,793,600
3Jun 24, 2026 15:233,006460,183,711438,940,00012,065,00016,793,600
4Jun 24, 2026 15:233,008460,563,401439,508,00011,809,00016,793,600
5Jun 24, 2026 15:233,012460,982,289439,592,00012,230,00016,793,600
6Jun 24, 2026 15:233,014461,327,993439,666,00012,480,00016,793,600
7Jun 24, 2026 15:233,017461,840,171440,700,00011,971,00016,793,600
8Jun 24, 2026 15:233,024462,916,863441,734,00011,882,00016,793,600
9Jun 24, 2026 15:233,730568,896,384547,803,00011,809,00016,793,600