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 7, 2024 00:32Huy Duc LeHuy Duc LeScore: 3,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 00:322,988514,036,765448,233,533016,953,344
2Mar 7, 2024 00:322,994515,495,009449,091,259016,953,344
3Mar 7, 2024 00:322,999518,015,897449,865,706016,949,248
4Mar 7, 2024 00:323,022485,077,162422,221,00031,016,00017,211,392
5Mar 7, 2024 00:323,027482,379,391427,986,00025,999,00017,178,624
6Mar 7, 2024 00:323,029486,290,340426,456,00027,964,00017,031,168
7Mar 7, 2024 00:323,032478,841,124424,880,00029,991,00017,207,296
8Mar 7, 2024 00:323,033478,014,502422,988,00031,999,00017,170,432
9Mar 7, 2024 00:323,035486,875,710422,234,00033,018,00017,010,688
10Mar 7, 2024 00:323,036478,424,367427,480,00027,965,00017,018,880
11Mar 7, 2024 00:323,037482,493,757419,522,00035,959,00016,965,632
12Mar 7, 2024 00:323,039477,436,921429,838,00025,990,00016,990,208