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 13:33janwwwjanwwwScore: 2,691Success
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 13:382,675411,745,840386,620,00014,707,00016,793,600
2Oct 9, 2026 13:382,685413,216,048387,986,00014,775,00016,793,600
3Oct 9, 2026 13:382,688413,601,732388,625,00014,610,00016,793,600
4Oct 9, 2026 13:382,691414,741,244389,112,00014,665,00016,793,600
5Oct 9, 2026 13:382,691414,111,936388,941,00014,778,00016,793,600
6Oct 9, 2026 13:382,699415,946,257390,127,00014,790,00016,793,600
7Oct 9, 2026 13:382,704416,170,960390,686,00015,042,00016,793,600
8Oct 9, 2026 13:382,709416,978,313391,456,00015,041,00016,793,600
9Oct 9, 2026 13:382,721418,883,729393,220,00015,046,00016,793,600