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:15anboto1anboto1Score: 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:163,361514,193,243478,775,00025,428,00016,793,600
2Jul 29, 2026 23:163,364514,860,570479,517,00025,167,00016,793,600
3Jul 29, 2026 23:163,367515,182,019480,027,00025,147,00016,793,600
4Jul 29, 2026 23:163,373515,964,967480,421,00025,613,00016,793,600
5Jul 29, 2026 23:163,373516,221,078480,648,00025,391,00016,793,600
6Jul 29, 2026 23:163,377516,763,890480,697,00025,871,00016,793,600
7Jul 29, 2026 23:163,388518,310,954483,101,00025,231,00016,793,600
8Jul 29, 2026 23:163,396519,687,863484,053,00025,423,00016,793,600
9Jul 29, 2026 23:163,415522,280,078486,933,00025,396,00016,793,600