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:33anboto1anboto1Score: 3,632Success
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:333,628553,447,502516,686,00027,590,00016,793,600
2Jun 24, 2026 11:333,628553,355,357517,218,00026,996,00016,793,600
3Jun 24, 2026 11:333,628554,114,776515,793,00028,510,00016,793,600
4Jun 24, 2026 11:333,630553,811,608516,854,00027,791,00016,793,600
5Jun 24, 2026 11:333,632553,916,121516,429,00028,373,00016,793,600
6Jun 24, 2026 11:333,634554,332,297517,282,00027,835,00016,793,600
7Jun 24, 2026 11:333,635554,534,259517,306,00028,030,00016,793,600
8Jun 24, 2026 11:333,637554,833,498516,974,00028,667,00016,793,600
9Jun 24, 2026 11:333,640555,319,649517,888,00028,165,00016,793,600