Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 30, 2026 06:23Victor MerckléVictor MerckléScore: 2,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 06:252,52414,017,1424,979,0001,331,0002,113,536
2May 30, 2026 06:252,53815,795,5965,006,0001,339,0002,113,536
3May 30, 2026 06:252,59214,854,9145,114,0001,366,0002,113,536
4May 30, 2026 06:252,59817,218,1455,137,0001,359,0002,113,536
5May 30, 2026 06:252,62016,150,5085,221,0001,329,0002,113,536
6May 30, 2026 06:252,62414,890,6275,227,0001,333,0002,113,536
7May 30, 2026 06:252,62514,362,1235,235,0001,329,0002,113,536
8May 30, 2026 06:252,62715,215,2695,235,0001,333,0002,113,536
9May 30, 2026 06:252,63114,419,1774,301,0002,278,0002,113,536