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:55anboto1anboto1Score: 3,279Success
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:573,259498,988,853464,436,00024,563,00016,793,600
2Jul 29, 2026 23:573,266499,814,539465,641,00024,282,00016,793,600
3Jul 29, 2026 23:573,271500,684,186465,948,00024,840,00016,793,600
4Jul 29, 2026 23:573,276501,443,622465,310,00026,103,00016,793,600
5Jul 29, 2026 23:573,279501,962,324466,557,00025,402,00016,793,600
6Jul 29, 2026 23:573,280503,273,350466,691,00025,318,00016,793,600
7Jul 29, 2026 23:573,281502,725,547466,858,00025,330,00016,793,600
8Jul 29, 2026 23:573,292504,466,415467,942,00025,877,00016,793,600
9Jul 29, 2026 23:573,341511,335,777475,523,00025,748,00016,793,600