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 listApr 19, 2023 03:14Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2023 03:143,924654,574,294588,626,829016,941,056
2Apr 19, 2023 03:143,925649,482,952588,816,871016,941,056
3Apr 19, 2023 03:143,930651,181,278589,487,759016,936,960
4Apr 19, 2023 03:143,942616,168,325566,303,00025,013,00016,949,248
5Apr 19, 2023 03:143,942616,491,584564,305,00027,014,00017,014,784
6Apr 19, 2023 03:143,943618,764,083568,520,00022,980,00016,957,440
7Apr 19, 2023 03:143,944617,609,456566,548,00024,980,00016,953,344
8Apr 19, 2023 03:143,944614,465,036565,652,00025,984,00017,207,296
9Apr 19, 2023 03:143,945614,078,746567,786,00023,990,00017,031,168
10Apr 19, 2023 03:143,946615,151,806570,920,00020,997,00016,957,440
11Apr 19, 2023 03:143,948614,842,976570,186,00022,007,00017,186,816
12Apr 19, 2023 03:143,948616,934,533568,233,00024,009,00017,121,280