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 22:52anboto1anboto1Score: 3,348Success
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 22:533,303505,580,871470,925,00024,658,00016,793,600
2Jul 29, 2026 22:533,304505,743,351471,260,00024,485,00016,793,600
3Jul 29, 2026 22:533,315508,907,450471,862,00025,459,00016,793,600
4Jul 29, 2026 22:533,323508,446,900473,873,00024,592,00016,793,600
5Jul 29, 2026 22:533,348512,389,056477,471,00024,822,00016,793,600
6Jul 29, 2026 22:533,354513,075,789478,735,00024,485,00016,793,600
7Jul 29, 2026 22:533,360514,884,841478,855,00025,154,00016,793,600
8Jul 29, 2026 22:533,362514,344,450479,068,00025,292,00016,793,600
9Jul 29, 2026 22:533,414522,235,280487,377,00024,752,00016,793,600