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 listApr 8, 2025 07:20NoSIMD_C#NoSIMD_C#Score: 53,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 07:2053,6648,093,357,8897,998,715,00050,896,00017,158,144
2Apr 8, 2025 07:2053,6928,095,804,0078,009,879,00043,917,00016,973,824
3Apr 8, 2025 07:2053,7238,101,286,5738,007,608,00050,889,00017,190,912
4Apr 8, 2025 07:2053,7568,109,325,9548,017,455,00045,910,00016,961,536
5Apr 8, 2025 07:2053,9728,142,447,5168,055,920,00039,920,00016,973,824
6Apr 8, 2025 07:2054,0858,163,727,9088,071,806,00040,912,00017,039,360
7Apr 8, 2025 07:2054,1488,153,465,6638,082,227,00039,946,00017,178,624
8Apr 8, 2025 07:2054,1568,170,204,1588,081,427,00041,914,00016,961,536
9Apr 8, 2025 07:2054,9458,275,662,5678,202,763,00038,951,00017,190,912