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,284Success
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,2101,862,123,2571,820,560,00010,979,00017,084,416
2Feb 2, 2025 20:3712,2191,862,677,9571,822,914,0009,977,00017,080,320
3Feb 2, 2025 20:3712,2281,864,376,8161,824,292,0009,979,00017,174,528
4Feb 2, 2025 20:3712,2771,870,773,1961,830,633,00010,979,00017,084,416
5Feb 2, 2025 20:3712,2841,873,396,3951,832,646,0009,976,00017,084,416
6Feb 2, 2025 20:3712,2871,870,284,6781,832,103,00010,976,00017,084,416
7Feb 2, 2025 20:3712,3221,882,429,6761,838,341,0009,980,00017,084,416
8Feb 2, 2025 20:3712,3231,883,644,2111,835,488,00012,975,00017,080,320
9Feb 2, 2025 20:3712,3421,879,308,0101,840,326,00010,978,00016,953,344