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 11:31anboto1anboto1Score: 4,320Success
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 11:314,308655,393,973622,532,00023,681,00016,793,600
2Jun 24, 2026 11:314,314656,423,884622,966,00024,223,00016,793,600
3Jun 24, 2026 11:314,315656,526,526623,022,00024,324,00016,793,600
4Jun 24, 2026 11:314,318658,309,891624,814,00023,028,00016,793,600
5Jun 24, 2026 11:314,320657,445,721623,993,00024,101,00016,793,600
6Jun 24, 2026 11:314,321657,506,233624,255,00024,034,00016,793,600
7Jun 24, 2026 11:314,322657,917,875624,524,00023,900,00016,793,600
8Jun 24, 2026 11:314,326658,044,760624,770,00024,167,00016,793,600
9Jun 24, 2026 11:314,332658,967,227625,429,00024,399,00016,797,696