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:06Victor MerckléVictor MerckléScore: 1,653Success
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:071,652257,360,630239,713,0008,197,00016,801,792stderr
2Jul 6, 2026 05:071,653257,406,366239,694,0008,272,00016,801,792stderr
3Jul 6, 2026 05:071,653257,477,365239,795,0008,203,00016,801,792stderr
4Jul 6, 2026 05:071,653257,576,447239,809,0008,208,00016,801,792stderr
5Jul 6, 2026 05:071,653257,605,334239,800,0008,277,00016,801,792stderr
6Jul 6, 2026 05:071,654258,065,381239,899,0008,266,00016,801,792stderr
7Jul 6, 2026 05:071,656258,003,846240,300,0008,228,00016,801,792stderr
8Jul 6, 2026 05:071,659258,338,815240,573,0008,316,00016,801,792stderr
9Jul 6, 2026 05:071,660258,551,642240,718,0008,334,00016,801,792stderr