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 11:27anboto1anboto1Score: 4,066Success
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 11:284,064619,072,568589,831,00019,864,00016,793,600
2Jun 24, 2026 11:284,065619,024,462590,170,00019,617,00016,793,600
3Jun 24, 2026 11:284,065619,113,164590,362,00019,449,00016,793,600
4Jun 24, 2026 11:284,066619,190,330590,192,00019,779,00016,793,600
5Jun 24, 2026 11:284,066619,084,625590,240,00019,670,00016,793,600
6Jun 24, 2026 11:284,068619,425,493590,285,00020,020,00016,793,600
7Jun 24, 2026 11:284,069619,545,207590,520,00019,870,00016,793,600
8Jun 24, 2026 11:284,070621,509,005590,839,00019,736,00016,793,600
9Jun 24, 2026 11:284,071620,026,008590,952,00019,790,00016,793,600