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 listApr 28, 2026 08:58TudyMTudyMScore: 5,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:015,480838,098,699793,089,00028,966,00017,145,856
2Apr 28, 2026 09:015,491844,450,754792,711,00030,988,00017,137,664
3Apr 28, 2026 09:015,497847,592,743793,603,00030,984,00017,145,856
4Apr 28, 2026 09:015,503844,015,129794,546,00030,982,00017,158,144
5Apr 28, 2026 09:015,506841,143,164800,937,00024,998,00017,145,856
6Apr 28, 2026 09:015,514849,624,956799,202,00027,972,00016,998,400
7Apr 28, 2026 09:015,601856,061,753807,327,00032,972,00017,149,952
8Apr 28, 2026 09:015,608854,688,141815,194,00026,006,00017,051,648
9Apr 28, 2026 09:015,688870,327,257818,241,00034,967,00017,149,952