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 23:18anboto1anboto1Score: 3,373Success
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 23:193,350513,160,082477,567,00025,013,00016,793,600
2Jul 29, 2026 23:193,358513,727,679478,097,00025,658,00016,793,600
3Jul 29, 2026 23:193,369515,363,717480,043,00025,337,00016,793,600
4Jul 29, 2026 23:193,370515,537,656480,050,00025,501,00016,793,600
5Jul 29, 2026 23:193,373516,018,904480,454,00025,574,00016,793,600
6Jul 29, 2026 23:193,373515,952,205480,485,00025,478,00016,793,600
7Jul 29, 2026 23:193,402520,259,406485,273,00025,122,00016,793,600
8Jul 29, 2026 23:193,414532,711,153486,622,00025,548,00016,793,600
9Jul 29, 2026 23:193,416522,412,843486,979,00025,555,00016,793,600