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 30, 2026 00:17anboto1anboto1Score: 3,212Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:183,205490,855,145466,213,00014,610,00016,797,696
2Jul 30, 2026 00:183,206491,010,795466,434,00014,603,00016,797,696
3Jul 30, 2026 00:183,208491,408,507466,769,00014,559,00016,797,696
4Jul 30, 2026 00:183,211491,655,740467,024,00014,676,00016,797,696
5Jul 30, 2026 00:183,212491,931,338466,926,00014,961,00016,797,696
6Jul 30, 2026 00:183,213492,317,323467,208,00014,778,00016,797,696
7Jul 30, 2026 00:183,214492,083,460467,419,00014,710,00016,797,696
8Jul 30, 2026 00:183,217493,023,068467,820,00014,737,00016,797,696
9Jul 30, 2026 00:183,219492,980,240468,390,00014,500,00016,797,696