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 18:47anboto1anboto1Score: 2,504Success
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 18:472,500386,118,556360,132,00015,010,00016,793,600
2Jul 29, 2026 18:472,502385,523,901360,295,00015,007,00016,793,600
3Jul 29, 2026 18:472,502385,582,707360,503,00014,942,00016,793,600
4Jul 29, 2026 18:472,503386,460,296360,572,00015,000,00016,793,600
5Jul 29, 2026 18:472,504385,934,928360,385,00015,287,00016,793,600
6Jul 29, 2026 18:472,505386,102,187360,722,00015,129,00016,793,600
7Jul 29, 2026 18:472,506386,718,258360,557,00015,371,00016,793,600
8Jul 29, 2026 18:472,509387,391,645361,307,00015,150,00016,793,600
9Jul 29, 2026 18:472,509387,420,815361,474,00014,987,00016,793,600