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:33anboto1anboto1Score: 2,890Success
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:372,888443,295,078420,124,00013,202,00016,793,600
2Jul 29, 2026 22:372,888443,243,616420,059,00013,228,00016,793,600
3Jul 29, 2026 22:372,888443,626,669420,048,00013,262,00016,793,600
4Jul 29, 2026 22:372,889444,776,146420,127,00013,310,00016,793,600
5Jul 29, 2026 22:372,890443,584,461420,267,00013,315,00016,793,600
6Jul 29, 2026 22:372,890443,480,205420,287,00013,283,00016,793,600
7Jul 29, 2026 22:372,893444,017,826420,709,00013,277,00016,793,600
8Jul 29, 2026 22:372,893443,903,759420,630,00013,392,00016,793,600
9Jul 29, 2026 22:372,894444,266,426420,847,00013,398,00016,793,600