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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 08:182,15213,043,5514,146,0001,235,0002,113,536
2Jun 2, 2026 08:182,15913,053,6784,156,0001,243,0002,113,536
3Jun 2, 2026 08:182,16113,046,4594,163,0001,241,0002,113,536
4Jun 2, 2026 08:182,16413,064,2784,171,0001,241,0002,113,536
5Jun 2, 2026 08:182,17413,123,6154,189,0001,247,0002,113,536
6Jun 2, 2026 08:182,17713,167,8984,197,0001,246,0002,113,536
7Jun 2, 2026 08:182,24613,289,3304,370,0001,247,0002,113,536
8Jun 2, 2026 08:182,25113,265,5534,377,0001,251,0002,113,536
9Jun 2, 2026 08:182,30813,449,1363,643,0002,127,0002,113,536