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:33Bernard TeoBernard TeoScore: 3,126Success
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:333,124541,911,675468,659,500016,904,192
2Apr 18, 2023 15:333,125535,924,305468,806,243016,900,096
3Apr 18, 2023 15:333,125528,295,888468,715,731016,908,288
4Apr 18, 2023 15:333,126541,781,457468,896,555016,904,192
5Apr 18, 2023 15:333,127525,855,413468,979,838016,896,000
6Apr 18, 2023 15:333,129549,784,226469,407,110016,900,096