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 21:49anboto1anboto1Score: 3,099Success
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 21:503,097474,730,021449,643,00014,985,00016,793,600
2Jul 29, 2026 21:503,097475,293,020449,540,00015,079,00016,793,600
3Jul 29, 2026 21:503,098474,853,780449,846,00014,990,00016,793,600
4Jul 29, 2026 21:503,098474,771,990449,726,00015,042,00016,793,600
5Jul 29, 2026 21:503,099474,828,741449,853,00015,011,00016,793,600
6Jul 29, 2026 21:503,099475,300,868449,821,00015,171,00016,793,600
7Jul 29, 2026 21:503,105475,825,444450,744,00015,121,00016,793,600
8Jul 29, 2026 21:503,108476,137,764451,021,00015,211,00016,793,600
9Jul 29, 2026 21:503,110476,519,099451,339,00015,196,00016,793,600