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 listJan 29, 2025 11:10NoSIMD_C#NoSIMD_C#Score: 383,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 11:10381,33057,264,069,82057,157,523,00041,975,00016,977,920
2Jan 29, 2025 11:10383,48357,584,174,61357,471,519,00050,970,00016,986,112
3Jan 29, 2025 11:10384,78457,778,623,64757,675,631,00041,972,00017,092,608