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 listApr 24, 2026 12:32olliecrowolliecrowScore: 3,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 12:323,186496,123,979472,005,0006,000,00017,174,528
2Apr 24, 2026 12:323,186499,645,073473,044,0005,000,00017,014,784
3Apr 24, 2026 12:323,188497,057,681474,284,0004,002,00017,170,432
4Apr 24, 2026 12:323,188495,873,100474,263,0004,002,00017,162,240
5Apr 24, 2026 12:323,189493,356,061475,357,0003,002,00017,235,968
6Apr 24, 2026 12:323,189494,191,674474,436,0003,995,00017,170,432
7Apr 24, 2026 12:323,190496,132,244472,532,0005,994,00017,227,776
8Apr 24, 2026 12:323,192493,392,367472,854,0005,998,00017,174,528
9Apr 24, 2026 12:323,201497,864,288477,231,0003,001,00017,178,624