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 17, 2025 22:28KeefeKeefeScore: 4,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2025 22:284,094645,176,915604,072,00010,001,00016,977,920
2May 17, 2025 22:284,094639,123,255605,137,0009,002,00017,117,184
3May 17, 2025 22:284,094637,670,355604,138,00010,002,00017,125,376
4May 17, 2025 22:284,095638,621,998604,221,00010,003,00016,953,344
5May 17, 2025 22:284,097642,384,375607,530,0006,994,00017,076,224
6May 17, 2025 22:284,098642,670,126605,635,0008,994,00017,182,720
7May 17, 2025 22:284,098638,252,733604,663,0009,994,00016,953,344
8May 17, 2025 22:284,099639,628,491605,904,0008,998,00017,113,088
9May 17, 2025 22:284,101639,980,465605,167,00010,002,00017,121,280