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 09:38anboto1anboto1Score: 7,361Success
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 09:397,3171,106,926,2461,063,743,00033,945,00016,793,600
2Jun 24, 2026 09:397,3201,107,340,1171,063,645,00034,479,00016,793,600
3Jun 24, 2026 09:397,3321,109,074,1121,066,952,00032,966,00016,793,600
4Jun 24, 2026 09:397,3441,111,040,6351,066,693,00034,952,00016,793,600
5Jun 24, 2026 09:397,3611,113,387,1641,070,151,00034,016,00016,793,600
6Jun 24, 2026 09:397,7031,164,867,8991,120,458,00035,048,00016,793,600
7Jun 24, 2026 09:397,7691,174,665,1951,130,760,00034,683,00016,793,600
8Jun 24, 2026 09:397,8011,179,442,0351,136,277,00034,007,00016,793,600
9Jun 24, 2026 09:397,8011,179,420,0771,135,936,00034,331,00016,793,600