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:01anboto1anboto1Score: 2,740Success
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:022,736420,425,292397,994,00012,454,00016,793,600
2Jul 29, 2026 17:022,737420,667,254398,174,00012,419,00016,793,600
3Jul 29, 2026 17:022,737420,715,025398,245,00012,412,00016,793,600
4Jul 29, 2026 17:022,738420,710,147398,258,00012,451,00016,793,600
5Jul 29, 2026 17:022,740421,992,995398,813,00012,314,00016,793,600
6Jul 29, 2026 17:022,741421,239,153398,671,00012,520,00016,793,600
7Jul 29, 2026 17:022,743421,595,750398,998,00012,573,00016,793,600
8Jul 29, 2026 17:022,746421,941,295399,329,00012,617,00016,793,600
9Jul 29, 2026 17:022,751422,711,638399,998,00012,706,00016,793,600