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:15Tomislav TunkovicTomislav TunkovicScore: 1,673Success
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:161,668260,258,797240,994,0009,223,00016,027,648stderr
2Aug 15, 2026 16:161,669261,517,359241,110,0009,292,00016,027,648stderr
3Aug 15, 2026 16:161,671260,649,866241,423,0009,264,00016,027,648stderr
4Aug 15, 2026 16:161,672261,112,325241,514,0009,394,00016,027,648stderr
5Aug 15, 2026 16:161,673261,827,986242,476,0008,543,00016,027,648stderr
6Aug 15, 2026 16:161,673261,716,098242,487,0008,466,00016,027,648stderr
7Aug 15, 2026 16:161,674261,034,029242,603,0008,506,00016,027,648stderr
8Aug 15, 2026 16:161,675262,052,284242,788,0008,529,00016,027,648stderr
9Aug 15, 2026 16:161,677262,339,933243,068,0008,557,00016,027,648stderr