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 15, 2026 16:03Tomislav TunkovicTomislav TunkovicScore: 1,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 16:041,678261,822,118242,451,0009,370,00016,027,648stderr
2Aug 15, 2026 16:041,679263,003,692242,641,0009,234,00016,027,648stderr
3Aug 15, 2026 16:041,680262,050,929242,576,0009,426,00016,027,648stderr
4Aug 15, 2026 16:041,680262,001,690242,604,0009,413,00016,027,648stderr
5Aug 15, 2026 16:041,683262,483,389243,001,0009,491,00016,027,648stderr
6Aug 15, 2026 16:041,683263,284,932243,211,0009,338,00016,027,648stderr
7Aug 15, 2026 16:041,686263,727,937243,643,0009,362,00016,027,648stderr
8Aug 15, 2026 16:041,687263,541,342243,649,0009,454,00016,027,648stderr
9Aug 15, 2026 16:041,687263,106,619243,668,0009,424,00016,027,648stderr