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 5, 2026 05:32DanielDanielScore: 4,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 05:324,339680,268,510631,929,00018,967,00017,211,392
2Mar 5, 2026 05:324,339676,565,326635,944,00014,975,00017,051,648
3Mar 5, 2026 05:324,341675,618,305634,215,00016,978,00017,080,320
4Mar 5, 2026 05:324,343681,738,708635,503,00015,987,00017,002,496
5Mar 5, 2026 05:324,349678,918,009635,330,00016,982,00016,953,344
6Mar 5, 2026 05:324,350677,805,820638,464,00013,988,00017,133,568
7Mar 5, 2026 05:324,355678,850,148638,304,00014,983,00017,211,392
8Mar 5, 2026 05:324,363679,541,930637,442,00016,985,00017,133,568
9Mar 5, 2026 05:324,728738,968,435693,226,00015,982,00016,973,824