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 22:36anboto1anboto1Score: 2,870Success
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 22:382,868440,336,265416,989,00013,271,00016,793,600
2Jul 29, 2026 22:382,869440,408,937417,183,00013,256,00016,793,600
3Jul 29, 2026 22:382,869440,480,046417,139,00013,338,00016,793,600
4Jul 29, 2026 22:382,869440,327,288417,228,00013,262,00016,793,600
5Jul 29, 2026 22:382,870442,065,658417,184,00013,332,00016,793,600
6Jul 29, 2026 22:382,871440,643,813417,342,00013,326,00016,793,600
7Jul 29, 2026 22:382,873441,137,334417,621,00013,354,00016,793,600
8Jul 29, 2026 22:382,874441,270,716417,807,00013,358,00016,793,600
9Jul 29, 2026 22:382,874441,068,182417,790,00013,330,00016,793,600