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 listJul 12, 2023 21:16gchebanovgchebanovScore: 4,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 21:164,230704,677,648634,553,182016,920,576
2Jul 12, 2023 21:164,234711,534,663635,038,323016,924,672
3Jul 12, 2023 21:164,243712,344,050636,493,120016,916,480
4Jul 12, 2023 21:164,282670,004,621614,303,00027,968,00017,190,912
5Jul 12, 2023 21:164,283671,293,423614,496,00027,977,00017,076,224
6Jul 12, 2023 21:164,283672,997,139615,535,00026,979,00017,076,224
7Jul 12, 2023 21:164,292668,307,595621,776,00021,992,00017,072,128
8Jul 12, 2023 21:164,294671,911,762613,182,00030,958,00017,022,976
9Jul 12, 2023 21:164,304672,160,585620,589,00024,983,00017,088,512
10Jul 12, 2023 21:164,305676,985,374619,761,00025,989,00017,063,936
11Jul 12, 2023 21:164,309668,799,928624,342,00021,976,00017,113,088
12Jul 12, 2023 21:164,310670,660,650617,579,00028,980,00017,072,128