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 listAug 11, 2026 07:29Tomislav TunkovicTomislav TunkovicScore: 2,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 07:302,871440,775,398414,736,00016,014,00016,801,792stderr
2Aug 11, 2026 07:302,871440,601,793414,555,00016,103,00016,801,792stderr
3Aug 11, 2026 07:302,872440,915,158414,829,00016,020,00016,801,792stderr
4Aug 11, 2026 07:302,872441,700,417414,712,00016,216,00016,801,792stderr
5Aug 11, 2026 07:302,873441,219,035415,091,00016,003,00016,801,792stderr
6Aug 11, 2026 07:302,873441,079,002415,043,00016,002,00016,801,792stderr
7Aug 11, 2026 07:302,875441,421,341415,018,00016,307,00016,801,792stderr
8Aug 11, 2026 07:302,875441,840,908414,958,00016,316,00016,801,792stderr
9Aug 11, 2026 07:302,876441,587,253415,348,00016,167,00016,801,792stderr