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 21, 2023 05:03Yuriy LyfenkoYuriy LyfenkoScore: 4,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:234,301715,592,137645,192,199016,953,344
2Mar 21, 2023 04:234,306706,860,577645,961,921016,945,152
3Mar 21, 2023 04:234,325708,338,051648,700,163016,953,344
4Mar 21, 2023 04:234,396689,471,681636,456,00022,980,00017,137,664
5Mar 21, 2023 04:234,539709,357,884655,939,00024,959,00016,953,344
6Mar 21, 2023 04:234,543707,768,488654,419,00026,976,00016,969,728
7Mar 21, 2023 04:234,568712,929,815658,177,00026,966,00016,973,824
8Mar 21, 2023 04:234,569706,286,569661,311,00023,975,00016,945,152
9Mar 21, 2023 04:234,592723,083,050661,759,00026,990,00016,965,632
10Mar 21, 2023 04:234,595715,433,326663,243,00025,970,00016,994,304
11Mar 21, 2023 04:234,608715,201,454665,245,00025,970,00017,199,104
12Mar 21, 2023 04:234,638726,136,110669,754,00025,990,00017,035,264
13Mar 21, 2023 05:036,7391,071,517,0081,010,832,440016,949,248
14Mar 21, 2023 05:036,7721,071,549,1521,015,762,601016,949,248
15Mar 21, 2023 05:036,8361,099,978,4071,025,341,946016,949,248
16Mar 21, 2023 05:038,0811,286,136,3571,212,100,152016,941,056
17Mar 21, 2023 05:038,0821,295,083,8671,212,231,735016,949,248
18Mar 21, 2023 05:038,0861,280,064,2891,212,839,920016,953,344