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 1, 2023 21:14Yuriy LyfenkoYuriy LyfenkoScore: 3,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 21:143,921641,847,675588,142,977016,941,056
2Apr 1, 2023 21:143,922658,332,597588,264,976016,936,960
3Apr 1, 2023 21:143,922657,337,113588,270,990016,928,768
4Apr 1, 2023 21:143,941612,249,984567,086,00024,003,00017,039,360
5Apr 1, 2023 21:143,942618,954,380567,269,00024,011,00017,002,496
6Apr 1, 2023 21:143,942617,830,322568,341,00023,013,00016,957,440
7Apr 1, 2023 21:143,943619,851,054567,502,00023,978,00017,039,360
8Apr 1, 2023 21:143,944625,690,168564,553,00026,978,00016,949,248
9Apr 1, 2023 21:143,944618,548,762565,574,00025,980,00017,035,264
10Apr 1, 2023 21:143,945618,586,980565,725,00025,987,00016,961,536
11Apr 1, 2023 21:143,945617,277,815563,740,00027,987,00017,190,912
12Apr 1, 2023 21:143,947622,126,828565,032,00027,001,00017,190,912