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 7, 2024 00:34Huy Duc LeHuy Duc LeScore: 3,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 00:343,537595,442,615530,517,287016,969,728
2Mar 7, 2024 00:343,539595,029,434530,894,379016,949,248
3Mar 7, 2024 00:343,542584,331,075531,241,287016,945,152
4Mar 7, 2024 00:343,565560,824,375508,739,00025,986,00017,039,360
5Mar 7, 2024 00:343,569563,482,015500,438,00034,960,00017,076,224
6Mar 7, 2024 00:343,569560,183,760502,451,00032,964,00017,018,880
7Mar 7, 2024 00:343,573560,230,393512,955,00022,997,00017,039,360
8Mar 7, 2024 00:343,574563,043,237504,138,00032,008,00017,018,880
9Mar 7, 2024 00:343,576562,049,903502,476,00033,964,00017,113,088
10Mar 7, 2024 00:343,577560,420,052509,524,00026,974,00017,190,912
11Mar 7, 2024 00:343,579561,800,985505,833,00030,989,00017,154,048
12Mar 7, 2024 00:343,580569,402,456505,933,00030,995,00017,182,720