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:20Elijah KinElijah KinScore: 496,708Success
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:20496,4901,265,509,5421,239,228,0001,998,0002,310,144
2Mar 14, 2026 22:20496,5161,266,001,0101,239,292,0001,998,0002,310,144
3Mar 14, 2026 22:20496,5841,269,162,5621,240,461,000999,0002,375,680
4Mar 14, 2026 22:20496,6221,269,250,8791,238,557,0002,998,0002,301,952
5Mar 14, 2026 22:20496,7081,265,665,4931,239,770,0001,999,0002,301,952
6Mar 14, 2026 22:20496,7541,266,159,2131,240,887,000999,0002,301,952
7Mar 14, 2026 22:20496,7661,264,493,6121,239,917,0001,999,0002,314,240
8Mar 14, 2026 22:20496,8161,267,824,7121,241,039,0001,000,0002,301,952
9Mar 14, 2026 22:20496,9991,265,730,5891,240,498,0001,999,0002,314,240