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 03:12Victor MerckléVictor MerckléScore: 2,329Success
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 03:142,25613,183,0374,396,0001,245,0002,113,536
2Jun 2, 2026 03:142,29114,947,8534,488,0001,241,0002,113,536
3Jun 2, 2026 03:142,31313,449,9214,550,0001,234,0002,113,536
4Jun 2, 2026 03:142,32213,504,6214,565,0001,241,0002,113,536
5Jun 2, 2026 03:142,32913,426,4054,580,0001,244,0002,113,536
6Jun 2, 2026 03:142,33213,812,4434,581,0001,249,0002,113,536
7Jun 2, 2026 03:142,34713,506,3244,609,0001,259,0002,113,536
8Jun 2, 2026 03:142,36013,504,7924,642,0001,259,0002,113,536
9Jun 2, 2026 03:142,37613,581,8853,838,0002,102,0002,113,536