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 3, 2026 04:51Victor MerckléVictor MerckléScore: 1,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 04:521,722268,284,580250,586,0007,833,00016,801,792stderr
2Aug 3, 2026 04:521,724268,542,478250,519,0008,092,00016,801,792stderr
3Aug 3, 2026 04:521,725269,518,658250,879,0007,979,00016,801,792stderr
4Aug 3, 2026 04:521,725268,932,589250,944,0007,916,00016,801,792stderr
5Aug 3, 2026 04:521,726268,833,071250,908,0008,065,00016,801,792stderr
6Aug 3, 2026 04:521,726270,377,519251,100,0007,922,00016,801,792stderr
7Aug 3, 2026 04:521,731269,564,419251,715,0008,001,00016,801,792stderr
8Aug 3, 2026 04:521,731269,543,929251,625,0008,034,00016,801,792stderr
9Aug 3, 2026 04:521,732269,838,082251,889,0007,966,00016,801,792stderr