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 20, 2026 16:50BenBenScore: 4,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:524,176653,529,917605,525,00020,983,00016,945,152
2Apr 20, 2026 16:524,177651,590,130601,696,00024,987,00017,170,432
3Apr 20, 2026 16:524,181656,141,088604,183,00023,006,00017,170,432
4Apr 20, 2026 16:524,184652,252,981604,730,00022,989,00017,170,432
5Apr 20, 2026 16:524,186650,538,664603,926,00023,997,00017,170,432
6Apr 20, 2026 16:524,187653,455,444604,110,00024,004,00017,170,432
7Apr 20, 2026 16:524,188650,762,008605,371,00022,976,00017,166,336
8Apr 20, 2026 16:524,289668,552,833619,511,00023,981,00017,170,432
9Apr 20, 2026 16:524,352681,567,818629,918,00022,997,00017,170,432