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 05:01Victor MerckléVictor MerckléScore: 1,649Success
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 05:021,648256,773,310239,444,0007,778,00016,801,792stderr
2Jul 6, 2026 05:021,648256,776,177239,498,0007,778,00016,801,792stderr
3Jul 6, 2026 05:021,648256,711,406239,428,0007,788,00016,801,792stderr
4Jul 6, 2026 05:021,649256,886,016239,572,0007,860,00016,801,792stderr
5Jul 6, 2026 05:021,649256,860,078239,567,0007,796,00016,801,792stderr
6Jul 6, 2026 05:021,650257,065,577239,710,0007,928,00016,801,792stderr
7Jul 6, 2026 05:021,654257,717,560240,348,0007,893,00016,801,792stderr
8Jul 6, 2026 05:021,655257,743,503240,350,0007,914,00016,801,792stderr
9Jul 6, 2026 05:021,655257,809,629240,355,0007,961,00016,801,792stderr