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 18:04anboto1anboto1Score: 3,013Success
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 18:053,009461,437,349442,700,0008,685,00016,793,600
2Jul 29, 2026 18:053,010461,602,368442,936,0008,710,00016,793,600
3Jul 29, 2026 18:053,010461,927,490442,941,0008,674,00016,793,600
4Jul 29, 2026 18:053,010461,599,762442,913,0008,637,00016,793,600
5Jul 29, 2026 18:053,013461,878,727443,299,0008,689,00016,793,600
6Jul 29, 2026 18:053,015462,340,910443,587,0008,725,00016,793,600
7Jul 29, 2026 18:053,015462,394,024443,812,0008,581,00016,793,600
8Jul 29, 2026 18:053,020463,131,683444,466,0008,646,00016,793,600
9Jul 29, 2026 18:053,023463,456,992444,777,0008,733,00016,793,600