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 listOct 21, 2026 05:23e1011e1011Score: 16,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 05:2816,6282,505,462,3362,478,417,00015,923,00016,793,600
2Oct 21, 2026 05:2816,7292,522,426,5922,493,365,00016,119,00016,793,600
3Oct 21, 2026 05:2816,7592,525,638,2892,498,019,00015,957,00016,793,600
4Oct 21, 2026 05:2816,8622,540,148,1592,513,530,00015,845,00016,793,600
5Oct 21, 2026 05:2816,8662,540,813,5422,513,885,00016,123,00016,793,600
6Oct 21, 2026 05:2817,0452,567,681,8502,540,893,00015,953,00016,793,600
7Oct 21, 2026 05:2817,4152,623,115,6832,596,125,00016,150,00016,793,600
8Oct 21, 2026 05:2817,7972,680,513,4952,653,720,00015,883,00016,793,600
9Oct 21, 2026 05:2818,5472,792,998,2622,766,100,00016,060,00016,793,600