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:35anboto1anboto1Score: 3,429Success
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:363,413522,118,467490,608,00021,431,00016,793,600
2Jul 29, 2026 17:363,419523,036,605490,547,00022,400,00016,793,600
3Jul 29, 2026 17:363,421523,235,541491,039,00022,185,00016,793,600
4Jul 29, 2026 17:363,426524,120,624492,245,00021,799,00016,793,600
5Jul 29, 2026 17:363,429524,418,599492,104,00022,327,00016,793,600
6Jul 29, 2026 17:363,431524,717,755492,454,00022,205,00016,793,600
7Jul 29, 2026 17:363,436525,464,754493,396,00022,007,00016,793,600
8Jul 29, 2026 17:363,442526,531,470494,179,00022,270,00016,793,600
9Jul 29, 2026 17:363,463529,825,331497,910,00021,661,00016,793,600