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 listMay 5, 2026 07:31olliecrowolliecrowScore: 3,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 07:323,160491,171,205469,954,0004,188,00017,174,528
2May 5, 2026 07:323,161492,834,180470,073,0004,216,00017,170,432
3May 5, 2026 07:323,161493,033,084469,997,0004,211,00017,166,336
4May 5, 2026 07:323,161492,564,696469,891,0004,261,00017,170,432
5May 5, 2026 07:323,162493,343,893470,121,0004,237,00017,174,528
6May 5, 2026 07:323,162493,637,091470,141,0004,282,00017,154,048
7May 5, 2026 07:323,163492,304,049470,249,0004,209,00017,158,144
8May 5, 2026 07:323,164490,199,664470,046,0004,595,00017,158,144
9May 5, 2026 07:323,169490,061,797470,970,0004,487,00017,166,336