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 17:55anboto1anboto1Score: 2,601Success
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 17:562,600400,120,194375,380,00014,753,00016,793,600
2Jul 29, 2026 17:562,600400,153,166375,455,00014,607,00016,793,600
3Jul 29, 2026 17:562,600400,070,382375,276,00014,732,00016,793,600
4Jul 29, 2026 17:562,601400,181,915375,445,00014,712,00016,793,600
5Jul 29, 2026 17:562,601400,185,773375,492,00014,675,00016,793,600
6Jul 29, 2026 17:562,602400,341,219375,317,00015,020,00016,793,600
7Jul 29, 2026 17:562,604400,630,930375,815,00014,835,00016,793,600
8Jul 29, 2026 17:562,608401,844,042376,099,00015,134,00016,793,600
9Jul 29, 2026 17:562,609401,405,423376,520,00014,858,00016,793,600