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 listApr 1, 2025 21:30Aniruddha DebAniruddha DebScore: 4,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2025 21:304,725737,848,966704,704,0003,998,00017,113,088
2Apr 1, 2025 21:304,725730,443,959705,707,0002,998,00017,117,184
3Apr 1, 2025 21:304,727732,267,367708,082,0001,000,00017,203,200
4Apr 1, 2025 21:304,727736,953,487706,100,0003,000,00017,108,992
5Apr 1, 2025 21:304,728735,150,078708,260,0001,000,00017,108,992
6Apr 1, 2025 21:304,729736,753,785708,329,0001,000,00017,203,200
7Apr 1, 2025 21:304,731729,874,258707,692,0001,999,00017,104,896
8Apr 1, 2025 21:304,732729,984,192707,848,0001,999,00017,108,992
9Apr 1, 2025 21:304,733732,039,814707,939,0001,999,00017,113,088