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 listJun 14, 2026 14:57Victor MerckléVictor MerckléScore: 1,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 14:571,73511,961,6063,113,0001,226,0002,113,536
2Jun 14, 2026 14:571,73711,996,4783,123,0001,220,0002,113,536
3Jun 14, 2026 14:571,74611,874,0233,134,0001,232,0002,113,536
4Jun 14, 2026 14:571,77412,317,8013,200,0001,235,0002,113,536
5Jun 14, 2026 14:571,78212,102,6863,209,0001,246,0002,113,536
6Jun 14, 2026 14:571,79812,163,5843,272,0001,224,0002,113,536
7Jun 14, 2026 14:571,80312,186,6273,272,0001,237,0002,113,536
8Jun 14, 2026 14:571,84912,247,9573,413,0001,211,0002,113,536
9Jun 14, 2026 14:571,86412,316,3263,437,0001,224,0002,113,536