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 listJul 9, 2026 16:57Victor MerckléVictor MerckléScore: 1,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 16:581,647256,898,409239,315,0007,792,00016,801,792stderr
2Jul 9, 2026 16:581,647256,870,541239,246,0007,829,00016,801,792stderr
3Jul 9, 2026 16:581,648257,470,378239,304,0007,935,00016,801,792stderr
4Jul 9, 2026 16:581,648257,070,722239,434,0007,822,00016,801,792stderr
5Jul 9, 2026 16:581,648258,347,792239,417,0007,865,00016,801,792stderr
6Jul 9, 2026 16:581,649257,239,114239,565,0007,876,00016,801,792stderr
7Jul 9, 2026 16:581,653257,992,583240,127,0007,859,00016,801,792stderr
8Jul 9, 2026 16:581,653257,609,138240,148,0007,882,00016,801,792stderr
9Jul 9, 2026 16:581,655258,036,339240,368,0007,906,00016,801,792stderr