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 24, 2023 23:03Yuriy LyfenkoYuriy LyfenkoScore: 4,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 23:034,222702,147,047633,246,451016,945,152
2Mar 24, 2023 23:034,227701,335,248634,052,141016,945,152
3Mar 24, 2023 23:034,230712,652,594634,524,687016,941,056
4Mar 24, 2023 23:034,293673,692,943616,947,00026,953,00017,190,912
5Mar 24, 2023 23:034,300669,242,997619,974,00024,958,00016,998,400
6Mar 24, 2023 23:034,308676,784,486622,189,00023,968,00017,195,008
7Mar 24, 2023 23:034,313673,453,268622,921,00023,958,00016,961,536
8Mar 24, 2023 23:034,325683,168,353622,779,00025,990,00016,957,440
9Mar 24, 2023 23:034,328676,753,919623,256,00025,969,00017,088,512
10Mar 24, 2023 23:034,335673,327,717625,323,00024,972,00017,072,128
11Mar 24, 2023 23:034,351679,115,329627,604,00024,984,00017,022,976
12Mar 24, 2023 23:034,383680,992,378634,425,00022,979,00016,953,344