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 7, 2026 21:13CountHarebourgCountHarebourgScore: 56,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 21:1454,8998,246,196,6328,190,301,00044,692,00016,793,600
2Oct 7, 2026 21:1455,1058,278,342,8488,220,387,00045,470,00016,793,600
3Oct 7, 2026 21:1455,2418,296,785,1228,240,745,00045,501,00016,793,600
4Oct 7, 2026 21:1455,3768,317,602,6608,260,945,00045,475,00016,793,600
5Oct 7, 2026 21:1456,4288,475,255,8688,424,473,00039,812,00016,793,600
6Oct 7, 2026 21:1456,5528,494,455,1408,444,890,00037,971,00016,793,600
7Oct 7, 2026 21:1457,1558,584,018,5128,533,828,00039,564,00016,793,600
8Oct 7, 2026 21:1457,2138,593,089,5548,544,053,00037,960,00016,793,600
9Oct 7, 2026 21:1457,4068,621,488,2468,572,273,00038,627,00016,793,600