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 21:11Yuriy LyfenkoYuriy LyfenkoScore: 3,950Success
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 21:113,924642,643,412588,628,633016,941,056
2Apr 1, 2023 21:113,925665,593,181588,724,057016,936,960
3Apr 1, 2023 21:113,927654,531,109588,989,356016,941,056
4Apr 1, 2023 21:113,946619,797,749565,956,00025,997,00017,051,648
5Apr 1, 2023 21:113,948614,398,816565,157,00027,007,00017,047,552
6Apr 1, 2023 21:113,949628,817,806566,310,00026,014,00017,035,264
7Apr 1, 2023 21:113,950617,364,212566,484,00025,976,00017,207,296
8Apr 1, 2023 21:113,951616,169,228563,646,00028,981,00017,018,880
9Apr 1, 2023 21:113,951617,485,503565,662,00026,983,00016,961,536
10Apr 1, 2023 21:113,951618,413,593567,711,00024,987,00016,953,344
11Apr 1, 2023 21:113,960621,354,203567,025,00027,001,00016,969,728
12Apr 1, 2023 21:113,970617,835,504569,529,00025,978,00016,961,536