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:27anboto1anboto1Score: 2,948Success
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:282,943451,809,459432,935,0008,609,00016,793,600
2Jul 29, 2026 18:282,944451,694,882433,061,0008,687,00016,793,600
3Jul 29, 2026 18:282,946451,994,104433,342,0008,654,00016,793,600
4Jul 29, 2026 18:282,946452,088,804433,364,0008,605,00016,793,600
5Jul 29, 2026 18:282,948452,166,368433,555,0008,663,00016,793,600
6Jul 29, 2026 18:282,949452,432,246433,674,0008,699,00016,793,600
7Jul 29, 2026 18:282,950452,534,992433,760,0008,774,00016,793,600
8Jul 29, 2026 18:282,951452,789,370434,156,0008,635,00016,793,600
9Jul 29, 2026 18:282,953453,048,201434,334,0008,657,00016,793,600