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 9, 2026 08:13Karthik ReddyKarthik ReddyScore: 1,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:231,558242,781,516229,567,0004,240,00016,793,600
2Oct 9, 2026 08:231,558243,175,273229,535,0004,249,00016,793,600
3Oct 9, 2026 08:231,558242,839,296229,542,0004,283,00016,793,600
4Oct 9, 2026 08:231,560242,902,117229,763,0004,247,00016,793,600
5Oct 9, 2026 08:231,560243,162,269229,871,0004,225,00016,793,600
6Oct 9, 2026 08:231,561243,182,857229,907,0004,267,00016,793,600
7Oct 9, 2026 08:231,561243,914,090229,910,0004,306,00016,793,600
8Oct 9, 2026 08:231,570244,644,819231,206,0004,297,00016,793,600
9Oct 9, 2026 08:231,571244,804,588231,517,0004,252,00016,793,600