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 listOct 21, 2026 03:56e1011e1011Score: 16,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 04:0616,3472,463,062,5992,434,360,00017,761,00016,793,600
2Oct 21, 2026 04:0616,3622,465,579,7502,436,738,00017,656,00016,793,600
3Oct 21, 2026 04:0616,3692,466,252,6302,437,883,00017,552,00016,793,600
4Oct 21, 2026 04:0616,3712,466,595,2352,437,966,00017,753,00016,793,600
5Oct 21, 2026 04:0616,3792,467,784,1432,439,254,00017,631,00016,793,600
6Oct 21, 2026 04:0616,3902,469,611,2092,440,562,00017,958,00016,793,600
7Oct 21, 2026 04:0616,3922,469,904,5042,441,278,00017,645,00016,793,600
8Oct 21, 2026 04:0616,4162,473,835,2372,444,843,00017,639,00016,793,600
9Oct 21, 2026 04:0617,0472,568,032,6152,538,691,00018,384,00016,793,600