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:12Yuriy LyfenkoYuriy LyfenkoScore: 3,945Success
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:123,9211,147,672,003588,193,732016,936,960
2Apr 1, 2023 21:123,9221,153,238,564588,373,799016,936,960
3Apr 1, 2023 21:123,9231,161,744,867588,390,251017,002,496
4Apr 1, 2023 21:123,9431,115,159,280562,481,00028,973,00016,961,536
5Apr 1, 2023 21:123,9431,121,532,396564,483,00026,975,00017,149,952
6Apr 1, 2023 21:123,9431,119,077,144566,541,00024,979,00017,092,608
7Apr 1, 2023 21:123,9451,113,754,815565,749,00025,988,00016,969,728
8Apr 1, 2023 21:123,9451,119,062,128565,810,00025,991,00017,158,144
9Apr 1, 2023 21:123,9461,117,442,685565,868,00025,993,00016,957,440
10Apr 1, 2023 21:123,9471,112,423,864567,018,00025,000,00016,957,440
11Apr 1, 2023 21:123,9471,119,478,368563,086,00029,004,00017,162,240
12Apr 1, 2023 21:123,9491,118,788,895565,432,00026,972,00017,154,048