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 6, 2025 11:32KeefeKeefeScore: 4,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 11:324,266665,135,922629,852,0009,997,00017,158,144
2May 6, 2025 11:324,266665,471,576628,935,00010,998,00017,096,704
3May 6, 2025 11:324,266664,115,905629,958,0009,999,00017,043,456
4May 6, 2025 11:324,269666,473,875630,394,00010,006,00017,035,264
5May 6, 2025 11:324,270667,451,312633,550,0006,995,00017,059,840
6May 6, 2025 11:324,270665,465,392630,572,0009,993,00017,133,568
7May 6, 2025 11:324,272670,328,108629,731,00010,995,00017,055,744
8May 6, 2025 11:324,273665,141,171631,915,0008,998,00017,039,360
9May 6, 2025 11:324,274669,426,052631,070,00010,001,00016,953,344