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 26, 2026 20:21Dominique GarmierDominique GarmierScore: 92,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 20:1592,52813,915,851,21313,863,277,00015,991,00017,039,360
2Mar 26, 2026 20:2192,53213,912,879,75713,863,765,00015,990,00017,027,072
3Mar 26, 2026 20:1592,53513,914,327,14513,865,326,00014,991,00017,027,072
4Mar 26, 2026 20:2192,54613,917,491,20513,857,944,00023,986,00017,145,856
5Mar 26, 2026 20:2192,62413,930,554,26413,875,554,00017,990,00017,022,976
6Mar 26, 2026 20:1592,63513,931,065,52313,875,222,00019,988,00017,022,976