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:48Bernard TeoBernard TeoScore: 5,142Success
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:485,137842,270,805770,482,357016,969,728
2Apr 17, 2023 16:505,137835,152,801770,580,546016,973,824
3Apr 17, 2023 16:505,140844,289,854770,965,678016,973,824
4Apr 17, 2023 16:485,142837,251,947771,355,371016,965,632
5Apr 17, 2023 16:505,143835,145,646771,481,926016,965,632
6Apr 17, 2023 16:485,145829,140,840771,782,518016,977,920