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 listApr 17, 2023 16:53Bernard TeoBernard TeoScore: 3,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2023 16:533,538597,291,875530,740,727016,982,016
2Apr 17, 2023 16:533,539592,913,718530,899,900016,982,016
3Apr 17, 2023 16:533,542594,380,359531,365,860016,994,304
4Apr 17, 2023 16:533,543587,670,164531,408,968016,982,016
5Apr 17, 2023 16:533,543593,344,983531,376,124016,986,112
6Apr 17, 2023 16:533,543593,796,714531,518,337016,990,208