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 17, 2023 16:51Bernard TeoBernard TeoScore: 4,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2023 16:514,276701,115,269641,429,285016,969,728
2Apr 17, 2023 16:514,281710,506,804642,207,070016,965,632
3Apr 17, 2023 16:514,282705,286,226642,350,346016,961,536
4Apr 17, 2023 16:514,283705,917,294642,389,909016,977,920
5Apr 17, 2023 16:514,284706,092,170642,542,593016,969,728
6Apr 17, 2023 16:514,293702,679,055643,892,201016,961,536