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 20:20anboto1anboto1Score: 5,231Success
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 20:215,187788,195,280757,432,00020,629,00016,793,600
2Jul 29, 2026 20:215,187788,175,951757,630,00020,544,00016,793,600
3Jul 29, 2026 20:215,218793,555,802761,830,00021,012,00016,793,600
4Jul 29, 2026 20:215,230794,668,379763,717,00020,842,00016,793,600
5Jul 29, 2026 20:215,231794,817,810763,830,00020,964,00016,793,600
6Jul 29, 2026 20:215,234795,232,789764,353,00020,888,00016,793,600
7Jul 29, 2026 20:215,257799,163,204768,050,00020,565,00016,793,600
8Jul 29, 2026 20:215,286803,058,443771,627,00021,367,00016,793,600
9Jul 29, 2026 20:215,298804,850,179773,428,00021,368,00016,793,600