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 10, 2026 22:58Victor MerckléVictor MerckléScore: 3,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 23:023,32017,458,9485,831,0002,470,0002,138,112
2Jun 10, 2026 23:023,37617,593,3585,604,0002,836,0002,138,112
3Jun 10, 2026 23:023,41017,478,5605,656,0002,869,0002,138,112
4Jun 10, 2026 23:023,41217,505,7995,703,0002,829,0002,138,112
5Jun 10, 2026 23:023,44017,520,2044,913,0003,687,0002,187,264
6Jun 10, 2026 23:023,44217,614,2926,025,0002,580,0002,138,112
7Jun 10, 2026 23:023,45017,564,3585,713,0002,914,0002,138,112
8Jun 10, 2026 23:023,49417,745,7166,217,0002,518,0002,129,920
9Jun 10, 2026 23:023,58417,898,2415,204,0003,757,0002,183,168