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 16:34anboto1anboto1Score: 3,255Success
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 16:353,232494,845,738464,463,00020,379,00016,793,600
2Jul 29, 2026 16:353,234495,056,615464,990,00020,115,00016,793,600
3Jul 29, 2026 16:353,244496,594,299466,250,00020,356,00016,793,600
4Jul 29, 2026 16:353,248497,303,702466,967,00020,307,00016,793,600
5Jul 29, 2026 16:353,255498,350,903467,958,00020,349,00016,793,600
6Jul 29, 2026 16:353,261499,138,307468,825,00020,337,00016,793,600
7Jul 29, 2026 16:353,284502,710,968471,697,00020,924,00016,793,600
8Jul 29, 2026 16:353,290503,683,201473,192,00020,451,00016,793,600
9Jul 29, 2026 16:353,308506,485,117475,591,00020,736,00016,793,600