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 09:40Tomislav TunkovicTomislav TunkovicScore: 2,032Success
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 09:402,029315,165,713288,206,00016,155,00016,801,792stderr
2Aug 11, 2026 09:402,030314,766,148288,549,00016,088,00016,801,792stderr
3Aug 11, 2026 09:402,030314,584,298288,417,00016,108,00016,801,792stderr
4Aug 11, 2026 09:402,031315,503,963288,473,00016,276,00016,801,792stderr
5Aug 11, 2026 09:402,032314,843,220288,381,00016,481,00016,801,792stderr
6Aug 11, 2026 09:402,032314,822,477288,553,00016,269,00016,801,792stderr
7Aug 11, 2026 09:402,034315,959,544288,909,00016,237,00016,801,792stderr
8Aug 11, 2026 09:402,036315,443,113289,185,00016,234,00016,801,792stderr
9Aug 11, 2026 09:402,039316,613,854289,543,00016,378,00016,801,792stderr