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 8, 2026 12:18Victor MerckléVictor MerckléScore: 1,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 12:201,77612,060,5453,183,0001,258,0002,113,536
2Jun 8, 2026 12:201,78312,120,1513,198,0001,261,0002,113,536
3Jun 8, 2026 12:201,78812,127,8763,205,0001,267,0002,113,536
4Jun 8, 2026 12:201,79712,117,3913,223,0001,271,0002,113,536
5Jun 8, 2026 12:201,80312,225,6913,246,0001,263,0002,113,536
6Jun 8, 2026 12:201,81212,164,8613,264,0001,268,0002,113,536
7Jun 8, 2026 12:201,81412,149,0383,266,0001,270,0002,113,536
8Jun 8, 2026 12:201,85712,449,6813,375,0001,269,0002,113,536
9Jun 8, 2026 12:201,90612,801,9843,489,0001,276,0002,113,536