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:30KeefeKeefeScore: 4,090Success
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:304,088638,171,963603,176,00010,002,00017,154,048
2May 17, 2025 22:304,089644,407,538605,326,0008,004,00017,043,456
3May 17, 2025 22:304,089638,539,509604,384,0009,005,00016,986,112
4May 17, 2025 22:304,090637,854,287606,515,0006,994,00017,035,264
5May 17, 2025 22:304,090642,086,196605,554,0007,994,00017,039,360
6May 17, 2025 22:304,091641,820,748603,651,0009,994,00017,039,360
7May 17, 2025 22:304,092639,554,697601,826,00011,996,00017,141,760
8May 17, 2025 22:304,092640,574,774604,864,0008,997,00017,137,664
9May 17, 2025 22:304,108642,347,132607,236,0009,003,00017,068,032