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 listJun 12, 2026 05:11Victor MerckléVictor MerckléScore: 1,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 05:121,710265,670,618248,744,0007,826,00016,797,696
2Jun 12, 2026 05:121,710265,616,300248,904,0007,666,00016,797,696
3Jun 12, 2026 05:121,711265,935,292248,916,0007,822,00016,797,696
4Jun 12, 2026 05:121,711266,195,162248,986,0007,761,00016,797,696
5Jun 12, 2026 05:121,711266,218,438248,992,0007,765,00016,797,696
6Jun 12, 2026 05:121,712266,140,046249,152,0007,761,00016,797,696
7Jun 12, 2026 05:121,714266,319,739249,547,0007,693,00016,797,696
8Jun 12, 2026 05:121,718266,878,758249,942,0007,791,00016,797,696
9Jun 12, 2026 05:121,718266,936,528250,022,0007,813,00016,797,696