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 18, 2026 20:23Victor MerckléVictor MerckléScore: 1,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 20:241,651256,881,559239,948,0007,798,00016,797,696
2Jun 18, 2026 20:241,652257,052,735240,016,0007,886,00016,797,696
3Jun 18, 2026 20:241,653257,201,743240,089,0007,975,00016,797,696
4Jun 18, 2026 20:241,653257,184,568240,064,0008,027,00016,797,696
5Jun 18, 2026 20:241,653257,156,022240,060,0007,900,00016,797,696
6Jun 18, 2026 20:241,654257,145,228240,188,0007,914,00016,797,696
7Jun 18, 2026 20:241,657257,829,283240,721,0007,937,00016,797,696
8Jun 18, 2026 20:241,657257,745,361240,749,0007,912,00016,797,696
9Jun 18, 2026 20:241,659257,988,625240,870,0008,010,00016,797,696