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 6, 2026 04:54Victor MerckléVictor MerckléScore: 1,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 04:561,656258,006,474240,431,0008,089,00016,801,792stderr
2Jul 6, 2026 04:561,656258,001,205240,504,0008,042,00016,801,792stderr
3Jul 6, 2026 04:561,657258,066,809240,499,0008,149,00016,801,792stderr
4Jul 6, 2026 04:561,658258,253,358240,616,0008,125,00016,801,792stderr
5Jul 6, 2026 04:561,659258,394,083240,715,0008,160,00016,801,792stderr
6Jul 6, 2026 04:561,659258,344,356240,791,0008,142,00016,801,792stderr
7Jul 6, 2026 04:561,663258,920,101241,234,0008,219,00016,801,792stderr
8Jul 6, 2026 04:561,663263,071,673241,325,0008,211,00016,801,792stderr
9Jul 6, 2026 04:561,663258,990,187241,372,0008,154,00016,801,792stderr