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 listSep 21, 2026 13:44Andrew EpsteinAndrew EpsteinScore: 2,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 13:452,087323,578,134300,459,00012,710,00016,793,600
2Sep 21, 2026 13:452,088324,553,328300,509,00012,692,00016,793,600
3Sep 21, 2026 13:452,089323,674,572300,690,00012,744,00016,793,600
4Sep 21, 2026 13:452,089326,484,856300,744,00012,627,00016,793,600
5Sep 21, 2026 13:452,090323,831,518300,812,00012,756,00016,793,600
6Sep 21, 2026 13:452,091323,945,565300,966,00012,721,00016,793,600
7Sep 21, 2026 13:452,092324,224,655301,043,00012,811,00016,793,600
8Sep 21, 2026 13:452,092324,183,163300,940,00012,929,00016,793,600
9Sep 21, 2026 13:452,095324,592,233301,305,00012,967,00016,793,600