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 listMay 13, 2026 22:02Aleksei ShahoikaAleksei ShahoikaScore: 13,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 22:0213,5052,036,721,1281,997,909,00027,906,00016,793,600
2May 13, 2026 22:0213,5232,039,333,8812,002,350,00026,241,00016,793,600
3May 13, 2026 22:0213,6352,054,310,6002,020,460,00024,896,00016,793,600
4May 13, 2026 22:0213,6482,056,016,6992,021,200,00026,031,00016,793,600
5May 13, 2026 22:0213,6612,060,615,8232,023,101,00026,090,00016,793,600
6May 13, 2026 22:0213,7612,074,837,5782,037,207,00027,085,00016,793,600
7May 13, 2026 22:0213,7662,075,496,9742,037,599,00027,379,00016,793,600
8May 13, 2026 22:0214,0532,117,902,5632,082,840,00025,168,00016,793,600
9May 13, 2026 22:0215,4792,331,039,6202,296,330,00025,643,00016,793,600