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 17:03anboto1anboto1Score: 3,007Success
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 17:042,980457,082,844435,335,00011,714,00016,793,600
2Jul 29, 2026 17:042,986458,527,893436,259,00011,648,00016,793,600
3Jul 29, 2026 17:042,993459,112,263437,067,00012,007,00016,793,600
4Jul 29, 2026 17:043,004460,757,652438,698,00012,021,00016,793,600
5Jul 29, 2026 17:043,007461,297,865439,019,00012,122,00016,793,600
6Jul 29, 2026 17:043,009461,536,685439,289,00012,163,00016,793,600
7Jul 29, 2026 17:043,010461,731,864439,234,00012,388,00016,793,600
8Jul 29, 2026 17:043,010461,664,863439,531,00012,069,00016,793,600
9Jul 29, 2026 17:043,017462,628,114440,549,00012,055,00016,793,600