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 9, 2026 10:06Tomislav TunkovicTomislav TunkovicScore: 3,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 10:073,713567,158,845544,244,00012,819,00016,801,792stderr
2Aug 9, 2026 10:073,716567,514,462544,417,00013,027,00016,801,792stderr
3Aug 9, 2026 10:073,716568,251,111544,527,00012,877,00016,801,792stderr
4Aug 9, 2026 10:073,717567,880,926544,822,00012,874,00016,801,792stderr
5Aug 9, 2026 10:073,718568,454,113544,947,00012,853,00016,801,792stderr
6Aug 9, 2026 10:073,719567,962,984545,016,00012,870,00016,801,792stderr
7Aug 9, 2026 10:073,719568,717,043544,917,00013,049,00016,801,792stderr
8Aug 9, 2026 10:073,720568,899,742545,239,00012,903,00016,801,792stderr
9Aug 9, 2026 10:073,722568,327,357545,311,00013,003,00016,801,792stderr