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 23:43olliecrowolliecrowScore: 3,510Success
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 23:433,507548,336,767517,116,0009,002,00016,969,728
2Mar 4, 2026 23:433,508553,211,938516,133,00010,002,00017,051,648
3Mar 4, 2026 23:433,508553,544,684513,238,00013,006,00017,154,048
4Mar 4, 2026 23:433,509552,133,786512,354,00013,982,00016,957,440
5Mar 4, 2026 23:433,510554,985,299514,476,00011,987,00017,051,648
6Mar 4, 2026 23:433,510550,578,658515,521,00010,989,00017,051,648
7Mar 4, 2026 23:433,514555,753,157513,117,00014,003,00016,969,728
8Mar 4, 2026 23:433,517555,354,898517,491,0009,990,00017,010,688
9Mar 4, 2026 23:433,518556,759,317516,729,00010,994,00017,051,648