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 13:53anboto1anboto1Score: 3,103Success
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 13:533,086472,036,474437,910,00025,003,00016,793,600
2Jun 24, 2026 13:533,092473,052,538438,262,00025,628,00016,793,600
3Jun 24, 2026 13:533,092473,018,152438,434,00025,446,00016,793,600
4Jun 24, 2026 13:533,100474,297,012439,436,00025,692,00016,793,600
5Jun 24, 2026 13:533,103474,649,871439,892,00025,561,00016,793,600
6Jun 24, 2026 13:533,106475,250,039439,657,00026,376,00016,793,600
7Jun 24, 2026 13:533,109475,440,321441,263,00025,143,00016,793,600
8Jun 24, 2026 13:533,114476,239,466441,704,00025,403,00016,793,600
9Jun 24, 2026 13:533,118476,902,115442,623,00025,163,00016,793,600