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:33anboto1anboto1Score: 2,746Success
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:342,743421,515,325396,948,00014,565,00016,793,600
2Jul 29, 2026 17:342,743421,474,520396,936,00014,533,00016,793,600
3Jul 29, 2026 17:342,745421,653,515397,108,00014,649,00016,793,600
4Jul 29, 2026 17:342,746421,895,181397,346,00014,601,00016,793,600
5Jul 29, 2026 17:342,746421,952,459397,409,00014,526,00016,793,600
6Jul 29, 2026 17:342,746421,973,370397,306,00014,678,00016,793,600
7Jul 29, 2026 17:342,747422,291,697397,538,00014,563,00016,793,600
8Jul 29, 2026 17:342,750422,833,413397,993,00014,540,00016,793,600
9Jul 29, 2026 17:342,753423,031,157398,193,00014,789,00016,793,600