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:17anboto1anboto1Score: 3,156Success
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:193,136479,527,092446,090,00024,326,00016,793,600
2Jun 24, 2026 12:193,139480,011,177446,194,00024,719,00016,793,600
3Jun 24, 2026 12:193,141480,419,344446,823,00024,371,00016,793,600
4Jun 24, 2026 12:193,154482,311,662447,830,00025,310,00016,793,600
5Jun 24, 2026 12:193,156482,721,024447,769,00025,712,00016,793,600
6Jun 24, 2026 12:193,161483,244,944449,964,00024,232,00016,793,600
7Jun 24, 2026 12:193,164483,765,465448,710,00025,901,00016,793,600
8Jun 24, 2026 12:193,165483,960,353449,248,00025,505,00016,793,600
9Jun 24, 2026 12:193,170484,638,886449,697,00025,936,00016,793,600