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 16, 2023 07:53Bernard TeoBernard TeoScore: 11,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2023 07:5311,9721,866,543,6841,795,747,623016,998,400
2Apr 16, 2023 07:5211,9731,862,887,3921,795,938,217016,994,304
3Apr 16, 2023 07:5311,9731,860,097,1021,796,004,638016,998,400
4Apr 16, 2023 07:5311,9751,874,902,7401,796,310,366016,994,304
5Apr 16, 2023 07:5211,9761,862,470,9451,796,425,089016,994,304
6Apr 16, 2023 07:5211,9771,862,334,3971,796,537,781017,002,496
7Apr 16, 2023 07:5311,9791,858,653,7661,796,835,033017,002,496
8Apr 16, 2023 07:5311,9811,862,531,4641,797,094,158016,990,208
9Apr 16, 2023 07:5311,9821,853,149,5531,797,258,241016,998,400