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 2, 2026 00:16Victor MerckléVictor MerckléScore: 2,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 00:182,25313,234,3434,401,0001,232,0002,113,536
2Jun 2, 2026 00:182,25713,257,6124,406,0001,238,0002,113,536
3Jun 2, 2026 00:182,28313,370,8854,478,0001,231,0002,113,536
4Jun 2, 2026 00:182,28814,930,4644,484,0001,238,0002,113,536
5Jun 2, 2026 00:182,36713,507,0714,674,0001,244,0002,113,536
6Jun 2, 2026 00:182,37413,759,7274,694,0001,241,0002,113,536
7Jun 2, 2026 00:182,38013,587,2424,715,0001,235,0002,113,536
8Jun 2, 2026 00:182,38113,541,5924,712,0001,241,0002,113,536
9Jun 2, 2026 00:182,39013,919,4204,739,0001,237,0002,113,536