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 listMar 19, 2026 17:04Dominique GarmierDominique GarmierScore: 4,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 17:044,704735,612,007673,729,00031,939,00017,039,360
2Mar 19, 2026 17:044,715738,164,617679,351,00027,973,00016,998,400
3Mar 19, 2026 17:044,731745,495,062682,641,00026,946,00016,949,248
4Mar 19, 2026 17:044,743746,517,558682,527,00028,937,00017,051,648
5Mar 19, 2026 17:044,747741,931,127687,116,00024,967,00017,051,648
6Mar 19, 2026 17:044,778741,031,721692,713,00023,955,00016,949,248
7Mar 19, 2026 17:044,779748,121,068689,934,00026,958,00016,957,440
8Mar 19, 2026 17:044,784747,653,133683,693,00033,935,00016,957,440
9Mar 19, 2026 17:044,794751,689,261692,117,00026,965,00017,039,360