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 22:42Victor MerckléVictor MerckléScore: 1,598Success
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 22:451,596249,423,144235,280,0004,258,00016,797,696stderr
2Aug 30, 2026 22:451,596249,410,137235,288,0004,249,00016,797,696stderr
3Aug 30, 2026 22:451,597249,512,609235,293,0004,283,00016,797,696stderr
4Aug 30, 2026 22:451,597249,434,277235,341,0004,217,00016,797,696stderr
5Aug 30, 2026 22:451,598250,384,639235,424,0004,296,00016,797,696stderr
6Aug 30, 2026 22:451,598249,788,693235,562,0004,262,00016,797,696stderr
7Aug 30, 2026 22:451,602250,262,594236,083,0004,268,00016,797,696stderr
8Aug 30, 2026 22:451,602250,260,812236,035,0004,323,00016,797,696stderr
9Aug 30, 2026 22:451,603250,995,737236,203,0004,341,00016,797,696stderr