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 08:50Victor MerckléVictor MerckléScore: 1,874Success
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 08:581,75611,770,8883,163,0001,229,0002,117,632
2Jun 14, 2026 08:581,80611,769,1763,158,0001,357,0002,117,632
3Jun 14, 2026 08:581,86011,923,8763,402,0001,248,0002,117,632
4Jun 14, 2026 08:581,86212,025,3833,415,0001,240,0002,117,632
5Jun 14, 2026 08:581,87412,041,8963,451,0001,234,0002,117,632
6Jun 14, 2026 08:581,87812,031,3983,451,0001,246,0002,117,632
7Jun 14, 2026 08:581,87912,041,5263,444,0001,254,0002,117,632
8Jun 14, 2026 08:581,89211,961,9453,465,0001,267,0002,117,632
9Jun 14, 2026 08:581,91212,016,6043,493,0001,288,0002,117,632