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 18:35Yuriy 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 18:353,912646,243,757586,836,436016,924,672
2Apr 22, 2023 18:353,913659,764,972586,925,556016,924,672
3Apr 22, 2023 18:353,913665,090,328586,979,833016,924,672
4Apr 22, 2023 18:353,940613,724,373563,023,00028,001,00017,195,008
5Apr 22, 2023 18:353,941614,585,891566,108,00025,004,00017,154,048
6Apr 22, 2023 18:353,941617,931,592566,177,00025,007,00017,203,200
7Apr 22, 2023 18:353,943611,838,386566,506,00024,978,00017,088,512
8Apr 22, 2023 18:353,944615,333,654565,599,00025,981,00017,182,720
9Apr 22, 2023 18:353,944614,189,724566,615,00024,983,00017,063,936
10Apr 22, 2023 18:353,944612,703,902565,660,00025,984,00017,063,936
11Apr 22, 2023 18:353,946620,692,518562,893,00028,994,00017,125,376
12Apr 22, 2023 18:353,947619,854,180564,110,00028,005,00017,195,008