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 16, 2026 23:57Aleksei ShahoikaAleksei ShahoikaScore: 1,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:581,977307,232,647290,996,0005,605,00016,797,696
2May 16, 2026 23:581,980307,365,619291,724,0005,371,00016,797,696
3May 16, 2026 23:581,980306,103,117291,804,0005,281,00016,797,696
4May 16, 2026 23:581,987307,625,800292,584,0005,472,00016,797,696
5May 16, 2026 23:581,987307,640,202292,771,0005,388,00016,797,696
6May 16, 2026 23:581,988309,108,658292,631,0005,592,00016,797,696
7May 16, 2026 23:581,992307,799,488292,913,0006,019,00016,797,696
8May 16, 2026 23:581,993308,043,536293,489,0005,509,00016,797,696
9May 16, 2026 23:581,994307,991,653293,766,0005,426,00016,797,696