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 04:09e1011e1011Score: 32,356Success
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:1232,3114,857,809,1824,837,443,0009,331,00016,793,600
2Oct 21, 2026 04:1232,3334,861,042,8534,840,651,0009,312,00016,793,600
3Oct 21, 2026 04:1232,3334,861,142,1234,840,661,0009,387,00016,793,600
4Oct 21, 2026 04:1232,3444,863,359,5604,842,239,0009,384,00016,793,600
5Oct 21, 2026 04:1232,3564,865,115,1694,844,193,0009,328,00016,793,600
6Oct 21, 2026 04:1232,3624,865,532,7374,844,981,0009,388,00016,793,600
7Oct 21, 2026 04:1232,3684,866,210,2094,845,756,0009,445,00016,793,600
8Oct 21, 2026 04:1232,3984,871,020,3104,850,488,0009,297,00016,793,600
9Oct 21, 2026 04:1232,4434,877,455,6664,857,245,0009,206,00016,793,600