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 listJul 29, 2026 22:17anboto1anboto1Score: 3,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 22:183,901595,174,772562,864,00022,337,00016,793,600
2Jul 29, 2026 22:183,913596,902,419564,756,00022,205,00016,793,600
3Jul 29, 2026 22:183,914597,101,280564,952,00022,223,00016,793,600
4Jul 29, 2026 22:183,919597,870,966565,685,00022,169,00016,793,600
5Jul 29, 2026 22:183,921598,589,386566,172,00022,097,00016,793,600
6Jul 29, 2026 22:183,922598,387,219566,134,00022,181,00016,793,600
7Jul 29, 2026 22:183,925598,833,601566,336,00022,464,00016,793,600
8Jul 29, 2026 22:183,926599,805,877566,832,00022,196,00016,793,600
9Jul 29, 2026 22:183,928599,456,910567,044,00022,283,00016,793,600