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 06:21Victor MerckléVictor MerckléScore: 1,699Success
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 06:221,698263,812,195247,069,0007,635,00016,797,696
2Jun 12, 2026 06:221,698263,966,727247,149,0007,687,00016,797,696
3Jun 12, 2026 06:221,698263,953,389247,152,0007,670,00016,797,696
4Jun 12, 2026 06:221,699264,421,750247,220,0007,761,00016,797,696
5Jun 12, 2026 06:221,699263,980,761247,232,0007,653,00016,797,696
6Jun 12, 2026 06:221,701264,325,914247,399,0007,783,00016,797,696
7Jun 12, 2026 06:221,704264,812,370247,909,0007,756,00016,797,696
8Jun 12, 2026 06:221,705264,926,686247,992,0007,833,00016,797,696
9Jun 12, 2026 06:221,705264,950,635247,952,0007,813,00016,797,696