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 11, 2026 10:14Tomislav TunkovicTomislav TunkovicScore: 1,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 10:151,868290,246,095271,261,0008,951,00016,797,696
2Aug 11, 2026 10:151,868291,113,475271,304,0009,042,00016,797,696
3Aug 11, 2026 10:151,868291,039,268271,339,0008,949,00016,797,696
4Aug 11, 2026 10:151,868291,145,355271,274,0009,001,00016,797,696
5Aug 11, 2026 10:151,868290,987,474271,234,0009,015,00016,797,696
6Aug 11, 2026 10:151,869290,416,166271,483,0008,994,00016,797,696
7Aug 11, 2026 10:151,869291,061,930271,386,0009,022,00016,797,696
8Aug 11, 2026 10:151,870291,334,782271,489,0009,098,00016,797,696
9Aug 11, 2026 10:151,870291,407,150271,501,0009,137,00016,797,696