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 15, 2026 02:38Elijah KinElijah KinScore: 16,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 02:3816,68967,746,42538,671,0003,052,0002,412,544
2Mar 15, 2026 02:3816,70570,573,77939,726,0002,037,0002,301,952
3Mar 15, 2026 02:3816,74267,882,68639,861,0001,993,0002,260,992
4Mar 15, 2026 02:3816,75467,666,70137,897,0003,989,0002,392,064
5Mar 15, 2026 02:3816,75768,460,78836,906,0004,987,0002,301,952
6Mar 15, 2026 02:3816,76071,166,28636,911,0004,988,0002,265,088
7Mar 15, 2026 02:3817,29468,885,55839,213,0004,021,0002,265,088
8Mar 15, 2026 02:3817,36169,923,53041,385,0002,018,0002,265,088
9Mar 15, 2026 02:3817,46466,985,70741,631,0002,030,0002,306,048