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 17, 2026 00:02Aleksei ShahoikaAleksei ShahoikaScore: 1,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:061,982307,275,329291,865,0005,480,00016,797,696
2May 17, 2026 00:061,983307,232,379292,034,0005,494,00016,797,696
3May 17, 2026 00:061,984308,041,908292,192,0005,430,00016,797,696
4May 17, 2026 00:061,984306,670,028292,355,0005,368,00016,797,696
5May 17, 2026 00:061,984306,772,657292,316,0005,350,00016,797,696
6May 17, 2026 00:061,987309,919,152292,442,0005,615,00016,797,696
7May 17, 2026 00:061,987307,700,982292,710,0005,425,00016,797,696
8May 17, 2026 00:061,988309,129,299292,797,0005,473,00016,797,696
9May 17, 2026 00:061,995308,232,992293,872,0005,477,00016,797,696