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 08:05Huy Duc LeHuy Duc LeScore: 3,141Success
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 08:053,121535,918,788468,216,287016,990,208
2Mar 6, 2024 08:053,132535,715,589469,782,059016,969,728
3Mar 6, 2024 08:053,134491,961,189443,135,00027,008,00017,055,744
4Mar 6, 2024 08:053,137497,373,376437,629,00032,972,00017,063,936
5Mar 6, 2024 08:053,138493,206,370446,724,00023,985,00017,190,912
6Mar 6, 2024 08:053,139534,023,345470,792,025016,990,208
7Mar 6, 2024 08:053,141495,215,978440,145,00031,010,00017,047,552
8Mar 6, 2024 08:053,142503,336,564436,274,00035,022,00017,145,856
9Mar 6, 2024 08:053,147495,122,788449,086,00023,004,00017,092,608
10Mar 6, 2024 08:053,148500,602,687438,285,00033,944,00016,957,440
11Mar 6, 2024 08:053,149502,355,311445,447,00026,966,00017,195,008
12Mar 6, 2024 08:053,155503,030,142439,354,00033,950,00017,059,840