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:59anboto1anboto1Score: 3,171Success
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:593,149481,734,937447,055,00025,438,00016,793,600
2Jun 24, 2026 12:593,162483,463,915447,963,00026,435,00016,793,600
3Jun 24, 2026 12:593,164485,217,890448,617,00026,115,00016,793,600
4Jun 24, 2026 12:593,169484,595,678449,736,00025,744,00016,793,600
5Jun 24, 2026 12:593,171484,965,613450,690,00025,090,00016,793,600
6Jun 24, 2026 12:593,171484,867,499449,928,00025,727,00016,793,600
7Jun 24, 2026 12:593,174485,485,351450,304,00025,808,00016,793,600
8Jun 24, 2026 12:593,178486,012,894450,700,00026,139,00016,793,600
9Jun 24, 2026 12:593,204489,723,825454,834,00025,809,00016,793,600