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:41anboto1anboto1Score: 3,012Success
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:413,003459,655,575438,657,00011,797,00016,793,600
2Jun 24, 2026 15:413,005460,140,339438,745,00012,149,00016,793,600
3Jun 24, 2026 15:413,010460,606,930439,629,00011,889,00016,793,600
4Jun 24, 2026 15:413,011460,878,416439,964,00011,759,00016,793,600
5Jun 24, 2026 15:413,012461,007,503440,357,00011,450,00016,793,600
6Jun 24, 2026 15:413,013461,188,516440,179,00011,852,00016,793,600
7Jun 24, 2026 15:413,015461,510,923440,873,00011,523,00016,793,600
8Jun 24, 2026 15:413,016463,986,911440,021,00012,416,00016,793,600
9Jun 24, 2026 15:413,021462,355,603441,352,00011,833,00016,793,600