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 4, 2026 20:09DanielDanielScore: 4,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:094,713732,233,482691,001,00015,976,00017,203,200
2Mar 4, 2026 20:094,715738,325,031692,268,00014,984,00016,973,824
3Mar 4, 2026 20:094,719736,615,577687,816,00019,965,00017,055,744
4Mar 4, 2026 20:094,720737,654,989695,015,00012,981,00016,961,536
5Mar 4, 2026 20:094,728732,899,660693,277,00015,983,00017,043,456
6Mar 4, 2026 20:094,731737,263,829697,646,00011,976,00016,953,344
7Mar 4, 2026 20:094,740741,464,378699,961,00010,983,00016,969,728
8Mar 4, 2026 20:094,759748,239,031693,919,00019,968,00017,076,224
9Mar 4, 2026 20:095,142799,609,763758,298,00012,987,00017,211,392