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 15:26anboto1anboto1Score: 3,032Success
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 15:273,027463,307,662440,561,00013,532,00016,793,600
2Jun 24, 2026 15:273,029463,545,478440,670,00013,717,00016,793,600
3Jun 24, 2026 15:273,029463,618,338440,618,00013,778,00016,793,600
4Jun 24, 2026 15:273,029463,621,942440,456,00013,947,00016,793,600
5Jun 24, 2026 15:273,032464,133,974440,868,00013,975,00016,793,600
6Jun 24, 2026 15:273,033465,812,425441,296,00013,741,00016,793,600
7Jun 24, 2026 15:273,033464,369,011441,066,00013,941,00016,793,600
8Jun 24, 2026 15:273,035464,406,480441,057,00014,204,00016,793,600
9Jun 24, 2026 15:273,037464,839,370441,764,00013,897,00016,793,600