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 listJul 30, 2026 00:38anboto1anboto1Score: 2,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:392,946451,996,814426,969,00015,008,00016,793,600
2Jul 30, 2026 00:392,949452,576,213427,475,00015,017,00016,793,600
3Jul 30, 2026 00:392,949453,269,706427,387,00015,051,00016,793,600
4Jul 30, 2026 00:392,949452,484,294427,395,00015,061,00016,793,600
5Jul 30, 2026 00:392,949452,549,204427,176,00015,297,00016,793,600
6Jul 30, 2026 00:392,950452,610,422427,398,00015,110,00016,793,600
7Jul 30, 2026 00:392,952452,982,887427,737,00015,211,00016,793,600
8Jul 30, 2026 00:392,952452,836,573427,738,00015,086,00016,793,600
9Jul 30, 2026 00:392,955453,286,134428,126,00015,157,00016,793,600