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 listMar 14, 2026 22:01Elijah KinElijah KinScore: 1,260,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:011,260,3443,176,749,7443,148,861,0001,998,0002,281,472
2Mar 14, 2026 22:011,260,5063,176,873,0863,149,266,0001,998,0002,281,472
3Mar 14, 2026 22:011,260,8563,175,767,3983,150,141,0001,998,0002,424,832
4Mar 14, 2026 22:011,260,9203,183,104,8843,149,301,0002,998,0002,281,472
5Mar 14, 2026 22:011,260,9943,185,558,0193,150,485,0001,999,0002,281,472
6Mar 14, 2026 22:011,261,4363,180,997,9543,151,591,0001,999,0002,281,472
7Mar 14, 2026 22:011,262,3463,186,930,7963,153,866,0001,998,0002,330,624
8Mar 14, 2026 22:011,262,6293,188,118,6823,154,573,0001,999,0002,281,472
9Mar 14, 2026 22:011,266,4113,190,715,5883,163,029,0002,998,0002,289,664