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 10, 2026 22:47Victor MerckléVictor MerckléScore: 3,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 22:503,53217,795,7475,983,0002,848,0002,138,112
2Jun 10, 2026 22:503,55917,856,2255,201,0003,697,0002,187,264
3Jun 10, 2026 22:503,57618,003,2136,031,0002,911,0002,138,112
4Jun 10, 2026 22:503,59617,990,9816,426,0002,566,0002,138,112
5Jun 10, 2026 22:503,61217,987,4336,137,0002,895,0002,134,016
6Jun 10, 2026 22:503,62718,003,4235,861,0003,208,0002,183,168
7Jun 10, 2026 22:503,69718,264,3255,923,0003,320,0002,138,112
8Jun 10, 2026 22:503,70418,104,3835,859,0003,401,0002,183,168
9Jun 10, 2026 22:503,77418,564,3805,759,0003,676,0002,134,016