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:12Victor MerckléVictor MerckléScore: 1,661Success
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:141,660258,911,384240,821,0008,319,00016,801,792stderr
2Jul 6, 2026 05:141,660258,600,710240,779,0008,332,00016,801,792stderr
3Jul 6, 2026 05:141,660258,497,287240,801,0008,227,00016,801,792stderr
4Jul 6, 2026 05:141,661258,645,841240,854,0008,370,00016,801,792stderr
5Jul 6, 2026 05:141,661259,241,420240,919,0008,339,00016,801,792stderr
6Jul 6, 2026 05:141,661259,614,397240,876,0008,364,00016,801,792stderr
7Jul 6, 2026 05:141,665259,213,290241,450,0008,301,00016,801,792stderr
8Jul 6, 2026 05:141,665259,387,056241,497,0008,302,00016,801,792stderr
9Jul 6, 2026 05:141,666259,394,111241,621,0008,356,00016,801,792stderr