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 30, 2026 00:30anboto1anboto1Score: 2,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:312,843436,564,916413,404,00013,158,00016,793,600
2Jul 30, 2026 00:312,843436,428,027413,358,00013,125,00016,793,600
3Jul 30, 2026 00:312,843436,572,320413,325,00013,214,00016,793,600
4Jul 30, 2026 00:312,844436,635,044413,333,00013,281,00016,793,600
5Jul 30, 2026 00:312,845436,949,079413,623,00013,231,00016,793,600
6Jul 30, 2026 00:312,847437,154,244413,611,00013,474,00016,793,600
7Jul 30, 2026 00:312,848437,186,664413,907,00013,310,00016,793,600
8Jul 30, 2026 00:312,848442,196,885413,970,00013,271,00016,793,600
9Jul 30, 2026 00:312,849437,444,271414,159,00013,312,00016,793,600