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 4, 2026 21:07Elijah KinElijah KinScore: 2,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 21:082,60615,516,9195,419,0001,097,0002,117,632
2Jun 4, 2026 21:082,61615,629,5855,437,0001,103,0002,117,632
3Jun 4, 2026 21:082,62118,029,3265,435,0001,118,0002,117,632
4Jun 4, 2026 21:082,62615,609,9625,434,0001,132,0002,117,632
5Jun 4, 2026 21:082,68815,804,6305,571,0001,151,0002,117,632
6Jun 4, 2026 21:082,71415,796,9695,644,0001,143,0002,117,632
7Jun 4, 2026 21:082,71715,789,8955,685,0001,108,0002,117,632
8Jun 4, 2026 21:082,79816,377,8235,838,0001,158,0002,117,632
9Jun 4, 2026 21:082,93816,774,2686,164,0001,183,0002,117,632