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:28anboto1anboto1Score: 3,383Success
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:293,368515,176,784479,892,00025,316,00016,793,600
2Jul 29, 2026 23:293,369515,466,226480,154,00025,323,00016,793,600
3Jul 29, 2026 23:293,381517,277,159481,474,00025,702,00016,793,600
4Jul 29, 2026 23:293,382517,342,730481,760,00025,609,00016,793,600
5Jul 29, 2026 23:293,383517,515,246481,684,00025,843,00016,793,600
6Jul 29, 2026 23:293,403522,591,302485,042,00025,484,00016,793,600
7Jul 29, 2026 23:293,418522,834,921487,502,00025,331,00016,793,600
8Jul 29, 2026 23:293,434525,150,580489,664,00025,479,00016,793,600
9Jul 29, 2026 23:293,457528,580,027493,731,00024,919,00016,793,600