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: 2,877Success
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:202,876441,556,337417,949,00013,539,00016,793,600
2Jul 29, 2026 23:202,876441,439,659418,049,00013,485,00016,793,600
3Jul 29, 2026 23:202,876441,521,335418,113,00013,406,00016,793,600
4Jul 29, 2026 23:202,876441,480,566417,988,00013,482,00016,793,600
5Jul 29, 2026 23:202,877441,595,150418,198,00013,432,00016,793,600
6Jul 29, 2026 23:202,878441,588,511418,317,00013,391,00016,793,600
7Jul 29, 2026 23:202,882442,354,840418,879,00013,547,00016,793,600
8Jul 29, 2026 23:202,883442,577,745419,039,00013,489,00016,793,600
9Jul 29, 2026 23:202,883442,497,904419,040,00013,457,00016,793,600