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 31, 2025 15:16KeefeKeefeScore: 4,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 15:164,024631,245,583593,653,0009,994,00017,174,528
2May 31, 2025 15:164,027633,839,142593,033,00011,000,00016,982,016
3May 31, 2025 15:164,029635,941,115595,407,0009,006,00017,178,624
4May 31, 2025 15:164,030628,366,020593,521,00010,991,00017,129,472
5May 31, 2025 15:164,032629,938,883593,856,00010,997,00017,178,624
6May 31, 2025 15:164,032632,160,295594,866,0009,997,00017,174,528
7May 31, 2025 15:164,035631,676,454596,251,0009,003,00017,092,608
8May 31, 2025 15:164,039632,293,877596,784,0008,996,00017,162,240
9May 31, 2025 15:164,047641,511,815595,039,00012,000,00017,170,432