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 18, 2025 20:41KeefeKeefeScore: 10,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 20:4110,6501,624,439,3501,585,437,00011,995,00017,154,048
2Apr 18, 2025 20:4110,6531,623,506,4511,582,890,00014,989,00016,965,632
3Apr 18, 2025 20:4110,6531,627,449,3421,580,922,00016,988,00016,969,728
4Apr 18, 2025 20:4110,6531,626,379,3651,585,924,00011,991,00016,973,824
5Apr 18, 2025 20:4110,6541,630,345,4371,578,046,00019,987,00017,141,760
6Apr 18, 2025 20:4110,6541,623,997,7191,585,104,00012,992,00017,006,592
7Apr 18, 2025 20:4110,6541,624,233,2091,580,132,00017,990,00017,129,472
8Apr 18, 2025 20:4110,6601,627,224,8631,585,062,00013,991,00017,133,568
9Apr 18, 2025 20:4110,6631,627,690,2111,582,432,00016,993,00017,125,376