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 listApr 12, 2026 13:48limanjun99limanjun99Score: 39,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 13:4839,888125,802,34398,714,0001,007,000835,584
2Apr 12, 2026 13:4839,934126,944,89695,843,0003,993,000835,584
3Apr 12, 2026 13:4839,935130,025,56295,844,0003,993,000782,336
4Apr 12, 2026 13:4839,946129,696,54495,872,0003,994,000901,120
5Apr 12, 2026 13:4839,977130,042,05396,944,0002,998,000839,680
6Apr 12, 2026 13:4839,998122,611,00595,997,0003,999,000909,312
7Apr 12, 2026 13:4840,037125,191,10095,088,0005,004,000835,584
8Apr 12, 2026 13:4840,057125,751,15798,140,0002,002,000884,736
9Apr 12, 2026 13:4840,220125,029,89197,533,0003,016,000917,504