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 listMar 4, 2026 18:32olliecrowolliecrowScore: 11,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:0011,8991,815,653,2171,774,922,0009,993,00016,969,728
2Mar 4, 2026 18:3211,9401,818,505,7971,777,022,00013,992,00016,957,440
3Mar 4, 2026 18:0011,9481,813,788,2701,780,224,00011,994,00017,158,144
4Mar 4, 2026 18:0011,9571,822,484,0821,782,588,00010,991,00017,027,072
5Mar 4, 2026 18:0011,9771,822,779,5061,785,599,00010,991,00016,977,920
6Mar 4, 2026 18:0011,9831,827,907,1791,789,527,0007,997,00017,031,168
7Mar 4, 2026 18:0011,9991,829,358,7871,788,830,00010,992,00016,982,016
8Mar 4, 2026 18:0012,0071,828,212,1361,789,008,00011,993,00016,969,728
9Mar 4, 2026 18:3212,0111,828,134,0601,794,614,0006,998,00017,031,168
10Mar 4, 2026 18:0012,0441,833,400,6231,795,565,00010,997,00016,982,016
11Mar 4, 2026 18:0012,0451,834,572,1091,796,784,0009,993,00017,039,360
12Mar 4, 2026 18:3212,0751,840,940,5441,800,273,00010,995,00016,982,016