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 20, 2023 04:20Yuriy LyfenkoYuriy LyfenkoScore: 5,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2023 04:235,023813,003,423753,385,943016,961,536
2Apr 20, 2023 04:235,028819,395,268754,130,866016,945,152
3Apr 20, 2023 04:235,062839,347,546759,293,966016,965,632
4Apr 20, 2023 04:205,103831,204,519765,495,435016,953,344
5Apr 20, 2023 04:205,108820,651,848766,167,298016,961,536
6Apr 20, 2023 04:205,126815,771,620768,827,838016,961,536
7Apr 20, 2023 04:205,463875,741,122819,448,969016,965,632
8Apr 20, 2023 04:205,473884,419,373820,977,627016,961,536
9Apr 20, 2023 04:205,476883,109,631821,434,974016,961,536