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 listAug 23, 2026 17:19Navneet RajNavneet RajScore: 21,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:2021,7833,277,892,8193,254,939,00012,656,00016,793,600
2Aug 23, 2026 17:2021,8043,281,815,4403,257,796,00012,884,00016,793,600
3Aug 23, 2026 17:2021,8173,282,705,1453,260,179,00012,494,00016,793,600
4Aug 23, 2026 17:2021,8863,292,905,2143,270,524,00012,402,00016,793,600
5Aug 23, 2026 17:2021,9103,297,245,8063,274,065,00012,461,00016,793,600
6Aug 23, 2026 17:2022,0293,314,359,0793,292,002,00012,437,00016,793,600
7Aug 23, 2026 17:2022,0383,315,677,5483,293,308,00012,434,00016,793,600
8Aug 23, 2026 17:2022,0653,319,825,0603,297,365,00012,460,00016,793,600
9Aug 23, 2026 17:2022,0683,320,188,0433,297,696,00012,561,00016,793,600