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:09anboto1anboto1Score: 2,890Success
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:092,890443,594,459420,388,00013,114,00016,793,600
2Jul 29, 2026 23:092,890443,678,070420,522,00013,110,00016,793,600
3Jul 29, 2026 23:092,890443,547,178420,412,00013,161,00016,793,600
4Jul 29, 2026 23:092,890443,602,682420,439,00013,173,00016,793,600
5Jul 29, 2026 23:092,890443,567,554420,418,00013,133,00016,793,600
6Jul 29, 2026 23:092,891443,808,060420,517,00013,195,00016,793,600
7Jul 29, 2026 23:092,896444,433,963421,372,00013,158,00016,793,600
8Jul 29, 2026 23:092,897444,660,563421,262,00013,367,00016,793,600
9Jul 29, 2026 23:092,897444,570,853421,254,00013,326,00016,793,600