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 22, 2023 19:28Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2023 19:283,911666,761,127586,721,294016,912,384
2Apr 22, 2023 19:283,912648,366,319586,810,656016,920,576
3Apr 22, 2023 19:283,912647,399,529586,815,297016,916,480
4Apr 22, 2023 19:283,942621,134,672566,293,00024,968,00017,203,200
5Apr 22, 2023 19:283,943621,322,381565,528,00025,978,00017,072,128
6Apr 22, 2023 19:283,944613,893,147568,582,00022,983,00016,994,304
7Apr 22, 2023 19:283,944616,566,763562,611,00028,979,00016,945,152
8Apr 22, 2023 19:283,944620,165,215566,617,00024,983,00017,207,296
9Apr 22, 2023 19:283,944614,818,197567,658,00023,985,00016,994,304
10Apr 22, 2023 19:283,945619,843,374565,703,00025,986,00016,949,248
11Apr 22, 2023 19:283,945614,721,816565,831,00025,992,00017,203,200
12Apr 22, 2023 19:283,948615,152,037564,126,00028,006,00017,203,200