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 listAug 15, 2026 17:30Tomislav TunkovicTomislav TunkovicScore: 1,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:311,626254,013,303234,683,0009,268,00016,027,648stderr
2Aug 15, 2026 17:311,626253,935,508234,597,0009,344,00016,027,648stderr
3Aug 15, 2026 17:311,626253,904,957234,613,0009,402,00016,027,648stderr
4Aug 15, 2026 17:311,627254,348,045235,770,0008,417,00016,027,648stderr
5Aug 15, 2026 17:311,628254,538,331234,906,0009,430,00016,027,648stderr
6Aug 15, 2026 17:311,628255,051,057235,908,0008,438,00016,027,648stderr
7Aug 15, 2026 17:311,629255,539,705234,946,0009,428,00016,027,648stderr
8Aug 15, 2026 17:311,630254,893,691236,131,0008,433,00016,027,648stderr
9Aug 15, 2026 17:311,635256,099,545236,747,0008,554,00016,027,648stderr