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 15, 2026 16:02Haha ExpertHaha ExpertScore: 5,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 16:025,420823,880,465801,920,00011,170,00016,793,600
2Sep 15, 2026 16:025,433825,552,137804,250,00010,773,00016,793,600
3Sep 15, 2026 16:025,439826,296,058804,876,00011,020,00016,793,600
4Sep 15, 2026 16:025,439827,667,734805,003,00010,900,00016,793,600
5Sep 15, 2026 16:025,446828,181,234806,179,00010,786,00016,793,600
6Sep 15, 2026 16:025,457829,865,200807,801,00010,841,00016,793,600
7Sep 15, 2026 16:025,464830,187,213808,932,00010,762,00016,793,600
8Sep 15, 2026 16:025,470830,946,467809,870,00010,710,00016,793,600
9Sep 15, 2026 16:025,481832,713,311811,465,00010,796,00016,793,600