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 listApr 17, 2026 00:59Jasper EdbrookeJasper EdbrookeScore: 10,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 00:5910,2881,565,857,0111,452,340,00090,896,00016,961,536
2Apr 17, 2026 00:5910,2961,570,044,6041,445,553,00098,901,00016,982,016
3Apr 17, 2026 00:5910,3031,567,403,8831,448,507,00096,900,00017,014,784
4Apr 17, 2026 00:5910,3071,574,993,3071,448,223,00097,879,00017,203,200
5Apr 17, 2026 00:5910,3131,578,365,7591,438,129,000108,858,00017,149,952
6Apr 17, 2026 00:5910,3171,578,412,0961,456,611,00090,913,00017,203,200
7Apr 17, 2026 00:5910,3401,586,291,5781,440,097,000110,853,00017,039,360
8Apr 17, 2026 00:5910,3571,586,560,5361,464,574,00088,913,00017,051,648
9Apr 17, 2026 00:5910,4181,590,719,3831,460,737,000101,911,00016,994,304