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 listMay 13, 2026 22:56Aleksei ShahoikaAleksei ShahoikaScore: 3,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 22:563,146483,701,742466,244,0005,697,00016,797,696
2May 13, 2026 22:563,149482,496,889466,662,0005,781,00016,797,696
3May 13, 2026 22:563,152482,306,228467,079,0005,852,00016,797,696
4May 13, 2026 22:563,155482,095,868467,651,0005,704,00016,797,696
5May 13, 2026 22:563,158482,663,230468,077,0005,665,00016,797,696
6May 13, 2026 22:563,164484,221,270469,012,0005,680,00016,797,696
7May 13, 2026 22:563,168486,204,272469,506,0005,779,00016,797,696
8May 13, 2026 22:563,168484,024,204469,530,0005,818,00016,797,696
9May 13, 2026 22:563,170484,388,567469,802,0005,700,00016,797,696