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 listJun 24, 2026 12:13anboto1anboto1Score: 3,208Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:143,203489,935,277454,724,00025,815,00016,793,600
2Jun 24, 2026 12:143,204489,884,396455,186,00025,455,00016,793,600
3Jun 24, 2026 12:143,204489,856,915455,745,00025,004,00016,793,600
4Jun 24, 2026 12:143,206490,183,140456,370,00024,629,00016,793,600
5Jun 24, 2026 12:143,208490,493,283455,680,00025,597,00016,793,600
6Jun 24, 2026 12:143,209490,702,374455,109,00026,390,00016,793,600
7Jun 24, 2026 12:143,218491,886,183457,362,00025,424,00016,793,600
8Jun 24, 2026 12:143,218491,896,501457,184,00025,607,00016,793,600
9Jun 24, 2026 12:143,220492,287,447457,353,00025,712,00016,793,600