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 30, 2026 00:03anboto1anboto1Score: 2,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:112,861439,268,533415,949,00013,347,00016,793,600
2Jul 30, 2026 00:112,861439,254,592415,780,00013,410,00016,793,600
3Jul 30, 2026 00:112,862439,214,810415,838,00013,490,00016,793,600
4Jul 30, 2026 00:112,862439,338,052415,829,00013,471,00016,793,600
5Jul 30, 2026 00:112,866439,889,985416,197,00013,716,00016,793,600
6Jul 30, 2026 00:112,867440,115,708416,652,00013,461,00016,793,600
7Jul 30, 2026 00:112,868440,162,680416,679,00013,522,00016,793,600
8Jul 30, 2026 00:112,868440,331,974416,697,00013,593,00016,793,600
9Jul 30, 2026 00:112,903455,251,595422,078,00013,398,00016,793,600