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 listJun 24, 2026 14:23anboto1anboto1Score: 3,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 14:243,095473,453,840439,566,00024,724,00016,793,600
2Jun 24, 2026 14:243,097473,754,136439,185,00025,429,00016,793,600
3Jun 24, 2026 14:243,101474,845,511439,485,00025,779,00016,793,600
4Jun 24, 2026 14:243,102474,598,365439,414,00025,945,00016,793,600
5Jun 24, 2026 14:243,108475,409,723441,622,00024,591,00016,793,600
6Jun 24, 2026 14:243,112475,962,833441,365,00025,562,00016,793,600
7Jun 24, 2026 14:243,112476,029,794441,338,00025,573,00016,793,600
8Jun 24, 2026 14:243,114476,318,686441,966,00025,197,00016,793,600
9Jun 24, 2026 14:243,114476,456,268442,055,00025,194,00016,793,600