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 13, 2026 01:52Victor MerckléVictor MerckléScore: 1,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 01:581,687260,739,691245,637,0007,558,00016,797,696
2Jun 13, 2026 01:581,687260,677,673245,564,0007,567,00016,797,696
3Jun 13, 2026 01:581,688260,976,869245,751,0007,586,00016,797,696
4Jun 13, 2026 01:581,688260,820,107245,501,0007,723,00016,797,696
5Jun 13, 2026 01:581,688260,788,537245,683,0007,541,00016,797,696
6Jun 13, 2026 01:581,689260,964,951245,745,0007,641,00016,797,696
7Jun 13, 2026 01:581,692261,575,568246,341,0007,603,00016,797,696
8Jun 13, 2026 01:581,692261,449,030246,212,0007,610,00016,797,696
9Jun 13, 2026 01:581,694261,650,671246,425,0007,692,00016,797,696