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 19:33Yuriy LyfenkoYuriy LyfenkoScore: 4,184Success
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 19:334,139684,819,130620,817,542016,941,056
2Apr 1, 2023 19:334,142691,129,420621,308,172016,941,056
3Apr 1, 2023 19:334,145696,798,567621,702,960016,936,960
4Apr 1, 2023 19:334,157653,609,557596,628,00026,938,00016,957,440
5Apr 1, 2023 19:334,177656,812,800598,524,00027,977,00017,022,976
6Apr 1, 2023 19:334,183647,700,660600,402,00026,973,00016,961,536
7Apr 1, 2023 19:334,184651,280,159600,596,00026,981,00017,141,760
8Apr 1, 2023 19:334,185652,281,179600,813,00026,991,00016,953,344
9Apr 1, 2023 19:334,196653,976,020606,490,00022,980,00016,961,536
10Apr 1, 2023 19:334,199654,517,702606,852,00022,994,00017,195,008
11Apr 1, 2023 19:334,231663,089,788609,726,00024,947,00017,084,416
12Apr 1, 2023 19:334,239662,469,671609,954,00025,955,00017,154,048