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: 56,092Success
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:3154,5298,213,425,1008,141,433,00037,936,00016,998,400
2Feb 5, 2025 06:3754,9088,279,694,6578,182,317,00053,916,00017,072,128
3Feb 3, 2025 05:3155,1678,317,030,1558,236,155,00038,925,00017,084,416
4Feb 3, 2025 05:3155,3608,344,923,4028,267,024,00036,924,00017,141,760
5Feb 3, 2025 05:3155,3918,346,582,3888,261,786,00046,896,00017,100,800
6Feb 3, 2025 05:3155,7938,417,184,4958,329,963,00038,925,00017,137,664
7Feb 3, 2025 05:3156,0928,455,209,1748,376,905,00036,920,00017,199,104
8Feb 3, 2025 05:3156,1718,465,990,5768,383,667,00041,913,00016,977,920
9Feb 5, 2025 06:3756,8208,565,585,1588,490,062,00032,957,00016,961,536
10Feb 3, 2025 05:3156,8268,559,980,8128,493,948,00029,961,00017,010,688
11Feb 5, 2025 06:3757,0968,596,190,0928,528,449,00035,955,00017,125,376
12Feb 3, 2025 05:3157,4248,651,444,1898,573,675,00039,951,00017,158,144