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 1, 2023 19:56Yuriy LyfenkoYuriy LyfenkoScore: 4,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 19:564,170694,877,154625,482,701016,941,056
2Apr 1, 2023 19:564,173691,048,302625,963,491016,936,960
3Apr 1, 2023 19:564,174706,331,141626,088,482016,936,960
4Apr 1, 2023 19:564,203658,273,961604,489,00025,978,00017,113,088
5Apr 1, 2023 19:564,228659,247,172609,180,00024,966,00016,994,304
6Apr 1, 2023 19:564,236658,576,552610,361,00024,973,00017,125,376
7Apr 1, 2023 19:564,236659,203,746608,471,00026,976,00017,113,088
8Apr 1, 2023 19:564,239664,893,472611,897,00023,995,00017,133,568
9Apr 1, 2023 19:564,242659,988,658612,288,00023,972,00016,969,728
10Apr 1, 2023 19:564,248663,068,664610,293,00026,968,00016,957,440
11Apr 1, 2023 19:564,254675,576,307613,127,00024,964,00017,035,264
12Apr 1, 2023 19:564,279670,287,374616,855,00024,953,00016,961,536