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 00:55Victor MerckléVictor MerckléScore: 5,792Success
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 00:555,76023,546,33711,177,0003,224,0002,117,632
2Jun 14, 2026 00:555,76723,649,34811,202,0003,217,0002,117,632
3Jun 14, 2026 00:555,77624,750,99811,236,0003,204,0002,117,632
4Jun 14, 2026 00:555,78923,697,10011,266,0003,207,0002,117,632
5Jun 14, 2026 00:555,79223,599,35011,269,0003,211,0002,117,632
6Jun 14, 2026 00:555,81023,677,62911,307,0003,219,0002,117,632
7Jun 14, 2026 00:556,03024,205,59311,882,0003,195,0002,117,632
8Jun 14, 2026 00:556,06424,329,14811,937,0003,223,0002,117,632
9Jun 14, 2026 00:556,14924,495,01312,141,0003,232,0002,117,632