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 listFeb 16, 2026 16:47Valentin KofmanValentin KofmanScore: 12,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 16:4712,4751,898,942,0571,851,253,00019,948,00017,170,432
2Feb 16, 2026 16:4712,4881,904,079,1351,844,312,00028,926,00017,170,432
3Feb 16, 2026 16:4712,4911,903,041,5481,856,741,00016,961,00017,186,816
4Feb 16, 2026 16:4712,5031,904,794,3981,855,534,00019,951,00016,953,344
5Feb 16, 2026 16:4712,5261,904,194,4391,853,965,00024,945,00016,982,016
6Feb 16, 2026 16:4712,5441,910,870,9201,863,687,00017,958,00016,953,344
7Feb 16, 2026 16:4712,5591,911,638,4311,859,940,00023,947,00016,953,344
8Feb 16, 2026 16:4712,5961,920,660,3501,863,484,00025,937,00016,945,152
9Feb 16, 2026 16:4712,6151,924,997,2081,861,396,00030,923,00016,953,344