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 02:31Huy Duc LeHuy Duc LeScore: 3,006Success
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 02:312,952512,504,784442,734,153016,965,632
2Mar 7, 2024 02:312,952507,482,821442,816,842016,969,728
3Mar 7, 2024 02:312,954506,889,500443,167,816016,965,632
4Mar 7, 2024 02:313,000476,849,156415,955,00033,996,00017,022,976
5Mar 7, 2024 02:313,005477,259,198419,727,00030,979,00017,010,688
6Mar 7, 2024 02:313,005475,136,565419,793,00030,984,00016,990,208
7Mar 7, 2024 02:313,006476,587,620415,967,00034,997,00017,195,008
8Mar 7, 2024 02:313,008477,255,644414,185,00037,016,00016,990,208
9Mar 7, 2024 02:313,010477,914,163417,526,00033,961,00017,092,608
10Mar 7, 2024 02:313,012475,833,942422,797,00028,986,00017,039,360
11Mar 7, 2024 02:313,012478,000,959418,836,00032,987,00017,031,168
12Mar 7, 2024 02:313,025477,632,332425,796,00027,986,00017,027,072