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 22, 2023 22:25Yuriy 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 22, 2023 22:253,915646,243,430587,286,013016,920,576
2Apr 22, 2023 22:253,917652,746,668587,608,321016,924,672
3Apr 22, 2023 22:253,919647,640,542587,904,715016,920,576
4Apr 22, 2023 22:253,942617,242,265565,277,00026,012,00017,117,184
5Apr 22, 2023 22:253,942616,248,378567,314,00024,013,00017,129,472
6Apr 22, 2023 22:253,943621,807,432569,416,00022,016,00017,203,200
7Apr 22, 2023 22:253,943620,300,136564,540,00026,978,00017,170,432
8Apr 22, 2023 22:253,944618,567,587565,547,00025,979,00017,043,456
9Apr 22, 2023 22:253,944616,803,716566,624,00024,983,00017,076,224
10Apr 22, 2023 22:253,944619,508,071566,668,00024,985,00016,945,152
11Apr 22, 2023 22:253,945617,854,570564,765,00026,988,00017,080,320
12Apr 22, 2023 22:253,946614,909,713564,957,00026,997,00017,207,296