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 listDec 28, 2024 01:03Joad NacerJoad NacerScore: 4,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 01:034,211654,937,684591,663,00039,977,00017,104,896
2Dec 28, 2024 01:034,215663,077,497590,287,00042,020,00016,949,248
3Dec 28, 2024 01:034,215658,400,629587,297,00045,022,00017,047,552
4Dec 28, 2024 01:034,216654,837,742588,497,00043,962,00017,039,360
5Dec 28, 2024 01:034,217655,168,843586,637,00045,971,00017,137,664
6Dec 28, 2024 01:034,219654,958,932586,835,00045,987,00017,190,912
7Dec 28, 2024 01:034,219652,215,500591,899,00040,993,00016,957,440
8Dec 28, 2024 01:034,220658,819,937585,059,00048,004,00017,051,648
9Dec 28, 2024 01:034,221655,853,928589,139,00044,010,00017,051,648