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 listNov 23, 2024 18:00E SequeiraE SequeiraScore: 53,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 18:0053,3778,051,345,7547,961,654,00044,913,00017,002,496
2Nov 23, 2024 18:0053,3988,052,045,7747,968,733,00040,921,00017,006,592
3Nov 23, 2024 18:0053,5478,076,013,9367,992,151,00039,915,00017,137,664
4Nov 23, 2024 18:0053,7038,093,185,9787,997,620,00057,881,00016,973,824
5Nov 23, 2024 18:0053,7648,107,010,4778,018,668,00045,923,00017,149,952
6Nov 23, 2024 18:0053,7718,107,279,0658,013,824,00051,895,00017,043,456
7Nov 23, 2024 18:0053,8328,116,453,2328,035,926,00038,926,00017,203,200
8Nov 23, 2024 18:0053,9388,139,312,8698,049,844,00040,928,00017,104,896
9Nov 23, 2024 18:0054,2638,178,722,1908,093,476,00045,911,00017,203,200