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 23, 2023 03:49Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2023 03:493,914641,934,421587,144,958016,924,672
2Apr 23, 2023 03:493,915650,568,954587,199,851016,916,480
3Apr 23, 2023 03:493,916655,307,842587,473,052016,924,672
4Apr 23, 2023 03:493,940616,522,971562,996,00027,999,00017,145,856
5Apr 23, 2023 03:493,941614,846,753567,163,00024,006,00016,986,112
6Apr 23, 2023 03:493,943620,779,072566,362,00025,016,00017,178,624
7Apr 23, 2023 03:493,944615,711,602565,577,00025,980,00016,977,920
8Apr 23, 2023 03:493,944619,220,178563,647,00027,982,00017,080,320
9Apr 23, 2023 03:493,944620,469,543564,648,00026,983,00017,158,144
10Apr 23, 2023 03:493,945615,605,228567,727,00023,988,00016,949,248
11Apr 23, 2023 03:493,946617,751,853564,919,00026,996,00017,096,704
12Apr 23, 2023 03:493,948618,938,442563,245,00029,012,00016,953,344