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 29, 2026 20:20anboto1anboto1Score: 5,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 20:205,371816,784,852781,665,00024,076,00016,793,600
2Jul 29, 2026 20:205,457828,688,794793,449,00025,156,00016,793,600
3Jul 29, 2026 20:205,475831,932,258796,550,00024,766,00016,793,600
4Jul 29, 2026 20:205,480832,249,332796,708,00025,430,00016,793,600
5Jul 29, 2026 20:205,536840,457,878806,557,00023,992,00016,793,600
6Jul 29, 2026 20:205,537842,023,512806,746,00023,939,00016,793,600
7Jul 29, 2026 20:205,812881,954,624847,215,00024,665,00016,793,600
8Jul 29, 2026 20:205,813884,116,979847,218,00024,848,00016,793,600
9Jul 29, 2026 20:206,030914,995,622879,070,00025,456,00016,793,600