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 05:04Yuriy LyfenkoYuriy LyfenkoScore: 4,180Success
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 05:044,144687,073,906621,592,106016,928,768
2Apr 20, 2023 05:044,152686,355,744622,829,035016,936,960
3Apr 20, 2023 05:044,169650,388,868601,447,00023,977,00016,949,248
4Apr 20, 2023 05:044,174684,511,683626,026,481016,941,056
5Apr 20, 2023 05:044,174650,031,713598,092,00027,957,00017,096,704
6Apr 20, 2023 05:044,175650,046,235601,235,00024,968,00016,973,824
7Apr 20, 2023 05:044,180649,675,245605,049,00021,965,00017,195,008
8Apr 20, 2023 05:044,183661,093,895597,498,00029,974,00017,072,128
9Apr 20, 2023 05:044,220658,642,845604,098,00028,956,00016,994,304
10Apr 20, 2023 05:044,292669,669,051619,818,00023,954,00017,018,880
11Apr 20, 2023 05:044,334677,554,010624,130,00025,963,00017,133,568
12Apr 20, 2023 05:044,374677,011,063629,081,00026,960,00016,961,536