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:21Yuriy 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:213,921648,984,768588,084,098016,936,960
2Apr 1, 2023 21:213,921666,875,453588,088,220016,941,056
3Apr 1, 2023 21:213,921654,555,307588,124,963016,936,960
4Apr 1, 2023 21:213,943622,562,987570,370,00021,013,00016,961,536
5Apr 1, 2023 21:213,943617,483,622569,418,00021,977,00017,174,528
6Apr 1, 2023 21:213,943614,081,678564,443,00026,973,00017,068,032
7Apr 1, 2023 21:213,943622,687,358566,498,00024,977,00017,063,936
8Apr 1, 2023 21:213,943619,611,097565,512,00025,977,00016,973,824
9Apr 1, 2023 21:213,944614,211,703565,663,00025,984,00017,010,688
10Apr 1, 2023 21:213,945617,330,414566,690,00024,986,00017,170,432
11Apr 1, 2023 21:213,946618,048,122567,961,00023,998,00016,969,728
12Apr 1, 2023 21:213,946619,423,462564,969,00026,998,00017,043,456