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 21, 2026 05:23e1011e1011Score: 19,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 05:2919,2712,901,640,8872,874,936,00015,863,00016,793,600
2Oct 21, 2026 05:2919,2732,901,866,1952,875,280,00015,772,00016,793,600
3Oct 21, 2026 05:2919,2732,902,012,9002,875,244,00015,795,00016,793,600
4Oct 21, 2026 05:2919,2742,902,091,1712,875,230,00015,934,00016,793,600
5Oct 21, 2026 05:2919,2752,903,935,5402,875,490,00015,848,00016,793,600
6Oct 21, 2026 05:2919,2752,902,278,6802,875,372,00015,967,00016,793,600
7Oct 21, 2026 05:2919,2752,902,403,9412,875,172,00016,145,00016,793,600
8Oct 21, 2026 05:2919,2772,902,473,2052,875,788,00015,863,00016,793,600
9Oct 21, 2026 05:2919,4532,928,934,7372,902,180,00015,876,00016,793,600