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 24, 2023 23:02Yuriy LyfenkoYuriy LyfenkoScore: 4,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 23:024,220697,727,212632,941,712016,936,960
2Mar 24, 2023 23:024,220700,479,818633,040,840016,945,152
3Mar 24, 2023 23:024,223687,952,952633,442,711016,945,152
4Mar 24, 2023 23:024,286673,925,485616,953,00025,955,00017,182,720
5Mar 24, 2023 23:024,307669,722,218620,075,00025,961,00016,961,536
6Mar 24, 2023 23:024,311668,884,609622,638,00023,986,00016,957,440
7Mar 24, 2023 23:024,311673,008,392622,682,00023,987,00017,002,496
8Mar 24, 2023 23:024,323673,895,464622,469,00025,977,00017,174,528
9Mar 24, 2023 23:024,325675,530,002623,712,00024,988,00016,961,536
10Mar 24, 2023 23:024,327675,179,122623,028,00025,959,00016,957,440
11Mar 24, 2023 23:024,348675,151,389627,179,00024,967,00017,076,224
12Mar 24, 2023 23:024,350675,289,559626,518,00025,980,00017,166,336