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 15:42anboto1anboto1Score: 3,909Success
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 15:443,900595,042,826578,357,0006,752,00016,793,600
2Jul 29, 2026 15:443,902595,296,824578,474,0006,868,00016,793,600
3Jul 29, 2026 15:443,902595,379,366578,203,0007,108,00016,793,600
4Jul 29, 2026 15:443,907596,134,168579,066,0007,061,00016,793,600
5Jul 29, 2026 15:443,909596,550,106579,426,0006,941,00016,793,600
6Jul 29, 2026 15:443,915597,389,878580,482,0006,868,00016,793,600
7Jul 29, 2026 15:443,917597,599,187580,747,0006,885,00016,793,600
8Jul 29, 2026 15:443,920598,125,540581,259,0006,890,00016,793,600
9Jul 29, 2026 15:443,922598,266,262581,515,0006,794,00016,793,600