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 listOct 19, 2026 08:11highload-churnerhighload-churnerScore: 2,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 08:111,996308,974,400291,881,0007,649,00016,793,600
2Oct 19, 2026 08:111,996308,857,157291,812,0007,617,00016,793,600
3Oct 19, 2026 08:112,000309,394,629292,427,0007,592,00016,793,600
4Oct 19, 2026 08:112,002309,894,021292,761,0007,670,00016,793,600
5Oct 19, 2026 08:112,004310,202,096292,968,0007,724,00016,793,600
6Oct 19, 2026 08:112,005310,649,031293,177,0007,715,00016,793,600
7Oct 19, 2026 08:112,008310,740,705293,731,0007,595,00016,793,600
8Oct 19, 2026 08:112,010310,968,894293,883,0007,671,00016,793,600
9Oct 19, 2026 08:112,016311,817,471294,859,0007,631,00016,793,600