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 18, 2023 15:31Bernard TeoBernard TeoScore: 3,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2023 15:323,124532,001,037468,563,047016,900,096
2Apr 18, 2023 15:323,124547,799,773468,666,074016,900,096
3Apr 18, 2023 15:313,125537,989,871468,751,809016,904,192
4Apr 18, 2023 15:323,125528,125,008468,761,807016,904,192
5Apr 18, 2023 15:323,125532,267,960468,771,078016,904,192
6Apr 18, 2023 15:313,127523,916,518469,006,711016,912,384
7Apr 18, 2023 15:323,127537,532,313469,003,138016,908,288
8Apr 18, 2023 15:323,128529,653,882469,216,315016,908,288
9Apr 18, 2023 15:313,130539,175,779469,528,310016,904,192