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 23:19anboto1anboto1Score: 3,418Success
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 23:193,389518,443,218483,192,00025,305,00016,793,600
2Jul 29, 2026 23:193,403521,885,745485,386,00025,100,00016,793,600
3Jul 29, 2026 23:193,412521,996,138486,258,00025,661,00016,793,600
4Jul 29, 2026 23:193,416522,582,635486,687,00025,834,00016,793,600
5Jul 29, 2026 23:193,418522,798,879487,241,00025,557,00016,793,600
6Jul 29, 2026 23:193,421523,162,180487,680,00025,530,00016,793,600
7Jul 29, 2026 23:193,424523,824,785488,069,00025,589,00016,793,600
8Jul 29, 2026 23:193,425523,949,120488,238,00025,581,00016,793,600
9Jul 29, 2026 23:193,436525,349,301489,854,00025,592,00016,793,600