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 listJul 29, 2026 18:15anboto1anboto1Score: 2,838Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 18:162,828434,192,489411,169,00013,033,00016,793,600
2Jul 29, 2026 18:162,832434,826,466411,670,00013,164,00016,793,600
3Jul 29, 2026 18:162,833434,950,641411,628,00013,330,00016,793,600
4Jul 29, 2026 18:162,836435,462,120412,263,00013,227,00016,793,600
5Jul 29, 2026 18:162,838435,819,199412,511,00013,273,00016,793,600
6Jul 29, 2026 18:162,843436,733,430413,240,00013,297,00016,793,600
7Jul 29, 2026 18:162,844438,062,653413,353,00013,336,00016,793,600
8Jul 29, 2026 18:162,847437,300,047414,028,00013,166,00016,793,600
9Jul 29, 2026 18:162,858438,523,909415,446,00013,255,00016,793,600