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 listFeb 5, 2025 06:37NoSIMD_C#NoSIMD_C#Score: 382,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:46381,94757,351,864,00457,250,143,00041,975,00017,002,496
2Feb 5, 2025 06:37382,18257,382,422,72457,277,286,00049,971,00017,010,688
3Feb 3, 2025 05:46382,24357,399,525,07157,291,406,00044,970,00016,982,016
4Feb 3, 2025 05:46382,48857,429,327,37057,333,233,00039,976,00017,084,416
5Feb 5, 2025 06:37384,01157,663,537,29357,554,747,00046,969,00016,986,112
6Feb 5, 2025 06:37384,06657,671,711,82157,568,966,00040,976,00017,006,592