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 6, 2024 16:10Huy Duc LeHuy Duc LeScore: 3,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 16:103,017517,377,360452,542,861016,969,728
2Mar 6, 2024 16:103,027512,600,365454,106,321016,965,632
3Mar 6, 2024 16:103,029522,438,978454,279,353016,965,632
4Mar 6, 2024 16:103,061487,231,921430,207,00029,013,00017,018,880
5Mar 6, 2024 16:103,066487,159,119433,947,00025,996,00017,195,008
6Mar 6, 2024 16:103,066485,238,138428,957,00030,996,00016,998,400
7Mar 6, 2024 16:103,070486,935,312429,519,00030,965,00017,018,880
8Mar 6, 2024 16:103,070488,340,391422,534,00037,958,00017,195,008
9Mar 6, 2024 16:103,071483,940,119431,612,00028,974,00017,014,784
10Mar 6, 2024 16:103,071482,859,692425,624,00034,969,00017,145,856
11Mar 6, 2024 16:103,071487,798,076434,633,00025,978,00017,035,264
12Mar 6, 2024 16:103,071487,045,219426,653,00033,972,00016,998,400