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 1, 2025 20:31Aniruddha DebAniruddha DebScore: 59,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2025 20:3158,8888,869,926,8208,830,186,0002,994,00017,211,392
2Apr 1, 2025 20:3158,9808,892,397,1208,842,040,0004,990,00016,953,344
3Apr 1, 2025 20:3158,9968,891,188,3178,842,351,0006,986,00017,121,280
4Apr 1, 2025 20:3159,0478,893,938,1908,852,012,0004,990,00016,953,344
5Apr 1, 2025 20:3159,0628,895,958,8808,857,298,0001,996,00016,953,344
6Apr 1, 2025 20:3159,0638,901,616,4458,855,407,0003,992,00016,953,344
7Apr 1, 2025 20:3159,1408,910,551,6328,866,058,0004,990,00016,953,344
8Apr 1, 2025 20:3159,2338,924,873,7278,882,005,0002,994,00016,953,344
9Apr 1, 2025 20:3159,2808,935,793,0178,887,960,0003,992,00016,953,344