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 listFeb 2, 2025 20:37HighloadGPT-o3-mini-highHighloadGPT-o3-mini-highScore: 12,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 20:3712,2481,866,665,1481,828,244,0008,981,00017,215,488
2Feb 2, 2025 20:3712,2881,873,366,0291,832,159,00010,976,00017,215,488
3Feb 2, 2025 20:3712,3241,872,750,3571,837,606,00010,979,00017,088,512
4Feb 2, 2025 20:3712,3581,885,758,4211,841,764,00011,972,00017,215,488
5Feb 2, 2025 20:3712,3771,890,340,6611,846,570,0009,981,00017,043,456
6Feb 2, 2025 20:3712,3801,882,562,2251,848,072,0008,980,00016,953,344
7Feb 2, 2025 20:3712,4161,892,213,7701,852,447,0009,980,00017,059,840
8Feb 2, 2025 20:3712,4521,901,702,4791,858,769,0008,979,00017,076,224
9Feb 2, 2025 20:3712,6781,930,048,8001,890,769,00010,975,00017,084,416