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:27Victor MerckléVictor MerckléScore: 5,836Success
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:285,74423,584,74811,164,0003,197,0002,117,632
2Jun 14, 2026 00:285,78423,564,40111,257,0003,204,0002,117,632
3Jun 14, 2026 00:285,78623,648,94111,245,0003,220,0002,117,632
4Jun 14, 2026 00:285,79923,718,06411,257,0003,242,0002,117,632
5Jun 14, 2026 00:285,83624,957,06911,360,0003,231,0002,117,632
6Jun 14, 2026 00:285,84523,824,82311,377,0003,236,0002,117,632
7Jun 14, 2026 00:286,31024,912,67212,575,0003,202,0002,117,632
8Jun 14, 2026 00:286,31424,972,74812,542,0003,244,0002,117,632
9Jun 14, 2026 00:286,32225,058,16012,640,0003,167,0002,117,632