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 25, 2023 22:05Bernard TeoBernard TeoScore: 12,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 22:0511,6571,813,544,3431,748,494,030016,932,864
2Mar 25, 2023 22:1411,7051,817,893,6361,755,713,158016,928,768
3Mar 25, 2023 22:1411,7531,819,890,3431,762,970,784016,932,864
4Mar 25, 2023 22:1412,3201,914,769,6511,847,951,093016,924,672
5Mar 25, 2023 22:1412,3251,903,578,3421,848,681,837016,932,864
6Mar 25, 2023 22:1412,3411,912,115,7741,851,200,459016,928,768
7Mar 25, 2023 22:0512,3491,918,823,3121,852,409,298016,932,864
8Mar 25, 2023 22:1412,3641,923,871,6081,854,602,178016,920,576
9Mar 25, 2023 22:0512,3741,923,447,8241,856,111,769017,014,784
10Mar 25, 2023 22:0512,3741,946,061,6101,856,158,339016,928,768
11Mar 25, 2023 22:0512,3841,911,287,0371,857,623,083016,920,576
12Mar 25, 2023 22:0512,3851,931,323,5511,857,804,931016,920,576