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 13, 2026 14:01Victor MerckléVictor MerckléScore: 19,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 14:0219,54556,196,31446,806,0002,058,0002,113,536
2Jun 13, 2026 14:0219,66956,501,62447,116,0002,058,0002,113,536
3Jun 13, 2026 14:0219,71256,506,81146,203,0003,079,0002,113,536
4Jun 13, 2026 14:0219,76956,823,11847,364,0002,059,0002,113,536
5Jun 13, 2026 14:0219,78356,850,63046,225,0003,233,0002,113,536
6Jun 13, 2026 14:0219,78656,775,95946,423,0003,043,0002,113,536
7Jun 13, 2026 14:0219,80556,898,09446,286,0003,227,0002,113,536
8Jun 13, 2026 14:0219,86157,049,40747,594,0002,059,0002,113,536
9Jun 13, 2026 14:0219,86457,031,34746,626,0003,035,0002,113,536