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 listMay 6, 2025 11:00KeefeKeefeScore: 4,504Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 11:004,499698,582,758662,924,00011,998,00017,162,240
2May 6, 2025 11:004,501701,760,007669,120,0006,001,00016,977,920
3May 6, 2025 11:004,503706,880,100664,482,00010,991,00017,154,048
4May 6, 2025 11:004,503698,849,527663,531,00011,991,00017,096,704
5May 6, 2025 11:004,504708,151,961665,581,0009,993,00016,949,248
6May 6, 2025 11:004,504702,161,688666,596,0008,994,00017,121,280
7May 6, 2025 11:004,504699,984,985664,622,00010,993,00017,039,360
8May 6, 2025 11:004,504707,428,167661,653,00013,992,00017,125,376
9May 6, 2025 11:004,507707,742,511663,976,00011,999,00017,170,432