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 5, 2026 00:40Victor MerckléVictor MerckléScore: 1,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:411,826283,086,848266,836,0007,130,00016,793,600
2Jun 5, 2026 00:411,826283,168,558267,027,0007,007,00016,793,600
3Jun 5, 2026 00:411,826283,046,772266,981,0006,992,00016,793,600
4Jun 5, 2026 00:411,827283,214,831267,167,0006,989,00016,793,600
5Jun 5, 2026 00:411,828283,392,794267,232,0007,046,00016,793,600
6Jun 5, 2026 00:411,829283,516,692267,369,0007,040,00016,793,600
7Jun 5, 2026 00:411,830283,704,602267,538,0007,019,00016,793,600
8Jun 5, 2026 00:411,832284,016,197267,866,0007,039,00016,793,600
9Jun 5, 2026 00:411,832284,272,652267,807,0007,008,00016,793,600