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 listMar 21, 2023 04:11Yuriy LyfenkoYuriy LyfenkoScore: 4,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:114,311701,988,152646,707,221016,953,344
2Mar 21, 2023 04:114,319718,340,185647,907,930016,949,248
3Mar 21, 2023 04:114,326717,652,051648,942,141016,953,344
4Mar 21, 2023 04:114,375678,483,528631,232,00024,969,00016,969,728
5Mar 21, 2023 04:114,486704,379,182646,006,00026,958,00016,965,632
6Mar 21, 2023 04:114,499703,614,984649,798,00024,992,00017,088,512
7Mar 21, 2023 04:114,545705,885,775657,842,00023,957,00017,035,264
8Mar 21, 2023 04:114,553713,495,594657,034,00025,961,00016,965,632
9Mar 21, 2023 04:114,573713,422,660660,966,00024,960,00016,957,440
10Mar 21, 2023 04:114,594712,928,245664,085,00024,965,00016,957,440
11Mar 21, 2023 04:114,603712,716,468663,428,00026,976,00016,953,344
12Mar 21, 2023 04:114,656722,437,109671,363,00026,974,00016,969,728