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:09anboto1anboto1Score: 2,857Success
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:152,855438,370,207415,212,00013,124,00016,793,600
2Jul 30, 2026 00:152,855438,495,744415,226,00013,114,00016,793,600
3Jul 30, 2026 00:152,856439,821,031415,167,00013,246,00016,793,600
4Jul 30, 2026 00:152,856438,684,414415,145,00013,342,00016,793,600
5Jul 30, 2026 00:152,857438,733,448415,359,00013,224,00016,793,600
6Jul 30, 2026 00:152,857438,596,987415,321,00013,271,00016,793,600
7Jul 30, 2026 00:152,862439,418,798415,998,00013,401,00016,793,600
8Jul 30, 2026 00:152,862439,344,916416,149,00013,251,00016,793,600
9Jul 30, 2026 00:152,864439,772,391416,388,00013,323,00016,793,600