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 10:37Dominique GarmierDominique GarmierScore: 4,685Success
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 10:374,676728,813,692688,467,00012,971,00017,072,128
2Mar 25, 2026 18:444,681729,655,238689,164,00012,984,00017,158,144
3Mar 25, 2026 18:434,682729,847,682690,275,00011,987,00017,080,320
4Mar 25, 2026 18:434,682731,174,145689,352,00012,968,00017,068,032
5Mar 25, 2026 18:444,685727,555,553689,809,00012,977,00017,080,320
6Mar 25, 2026 18:434,688727,223,195690,205,00012,985,00017,068,032
7Mar 26, 2026 10:374,737742,482,632698,552,00011,992,00017,076,224
8Mar 25, 2026 18:444,745741,823,629699,827,00011,979,00017,035,264
9Mar 26, 2026 10:374,745742,771,483699,727,00011,978,00017,182,720