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 listDec 16, 2024 23:58Mikhail ShirokovMikhail ShirokovScore: 16,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2024 23:5816,2522,464,522,9622,413,806,00023,988,00017,121,280
2Dec 16, 2024 23:5816,2902,465,261,3462,418,519,00024,984,00017,117,184
3Dec 16, 2024 23:5816,3212,478,255,5292,428,145,00019,992,00017,121,280
4Dec 16, 2024 23:5816,3372,474,598,7722,429,611,00020,988,00017,113,088
5Dec 16, 2024 23:5816,3552,481,979,8642,434,271,00018,986,00016,969,728
6Dec 16, 2024 23:5816,3712,483,509,8502,431,730,00023,987,00017,125,376
7Dec 16, 2024 23:5816,4092,483,913,9882,439,437,00021,985,00016,969,728
8Dec 16, 2024 23:5816,4252,490,001,8482,443,754,00019,989,00017,039,360
9Dec 16, 2024 23:5819,8073,004,103,4532,952,079,00018,994,00017,158,144