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 listMay 13, 2025 01:02Hayden DonnellyHayden DonnellyScore: 60,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2025 01:0259,9809,046,796,7508,960,125,00036,930,00016,965,632
2May 13, 2025 01:0259,9829,045,857,8128,942,399,00054,891,00017,043,456
3May 13, 2025 01:0259,9989,038,940,9668,948,771,00050,902,00017,047,552
4May 13, 2025 01:0260,0319,048,813,8438,962,794,00041,919,00016,965,632
5May 13, 2025 01:0260,0839,054,588,0048,968,482,00043,909,00016,965,632
6May 13, 2025 01:0260,1279,065,911,1138,970,188,00048,897,00016,965,632
7May 13, 2025 01:0260,1539,066,443,7488,972,040,00050,898,00016,965,632
8May 13, 2025 01:0260,1929,072,473,0018,965,905,00062,873,00016,965,632
9May 13, 2025 01:0260,2159,080,028,3548,984,353,00047,900,00016,965,632