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 listAug 30, 2026 20:20Victor MerckléVictor MerckléScore: 1,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:211,581247,092,795233,059,0004,137,00016,797,696stderr
2Aug 30, 2026 20:211,581247,144,808233,086,0004,162,00016,797,696stderr
3Aug 30, 2026 20:211,582247,207,711233,260,0004,154,00016,797,696stderr
4Aug 30, 2026 20:211,585247,638,377233,616,0004,197,00016,797,696stderr
5Aug 30, 2026 20:211,589251,007,681234,317,0004,171,00016,797,696stderr
6Aug 30, 2026 20:211,616261,524,732238,107,0004,351,00016,797,696stderr
7Aug 30, 2026 20:211,624262,834,428239,350,0004,327,00016,797,696stderr
8Aug 30, 2026 20:211,629264,696,750239,938,0004,511,00016,797,696stderr
9Aug 30, 2026 20:211,648263,421,983242,843,0004,416,00016,797,696stderr