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 1, 2026 16:19Victor MerckléVictor MerckléScore: 2,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 16:212,75214,519,9355,686,0001,194,0002,113,536
2Jun 1, 2026 16:212,76414,350,9445,715,0001,196,0002,113,536
3Jun 1, 2026 16:212,76715,673,4715,721,0001,198,0002,113,536
4Jun 1, 2026 16:212,77114,424,5795,722,0001,207,0002,113,536
5Jun 1, 2026 16:212,77314,489,8615,741,0001,192,0002,113,536
6Jun 1, 2026 16:212,77314,616,8315,723,0001,210,0002,113,536
7Jun 1, 2026 16:212,78414,574,2115,749,0001,211,0002,113,536
8Jun 1, 2026 16:212,82614,521,7195,865,0001,200,0002,113,536
9Jun 1, 2026 16:212,83014,720,0545,878,0001,197,0002,113,536