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 14, 2026 10:28Victor 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 14, 2026 10:291,659258,440,018241,042,0007,835,00016,801,792stderr
2Jul 14, 2026 10:291,660258,659,533241,133,0007,894,00016,801,792stderr
3Jul 14, 2026 10:291,660258,823,177241,177,0007,954,00016,801,792stderr
4Jul 14, 2026 10:291,661258,804,370241,183,0007,996,00016,801,792stderr
5Jul 14, 2026 10:291,661258,762,151241,372,0007,859,00016,801,792stderr
6Jul 14, 2026 10:291,661259,060,835241,345,0007,913,00016,801,792stderr
7Jul 14, 2026 10:291,667259,890,327242,089,0007,999,00016,801,792stderr
8Jul 14, 2026 10:291,667259,836,215242,157,0007,990,00016,801,792stderr
9Jul 14, 2026 10:291,667259,596,679242,095,0007,973,00016,801,792stderr