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:38limanjun99limanjun99Score: 69,168Success
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:3869,121201,452,035168,807,0003,995,000745,472
2Apr 12, 2026 13:3869,124199,574,842168,816,0003,995,000901,120
3Apr 12, 2026 13:3869,149204,496,858168,876,0003,997,000839,680
4Apr 12, 2026 13:3869,158201,518,110170,897,0001,998,000913,408
5Apr 12, 2026 13:3869,168197,331,052169,923,0002,998,000909,312
6Apr 12, 2026 13:3869,177195,419,707167,945,0004,998,000782,336
7Apr 12, 2026 13:3869,178198,623,901169,946,0002,999,000905,216
8Apr 12, 2026 13:3869,195206,035,045170,989,0001,999,000712,704
9Apr 12, 2026 13:3869,267200,614,926171,166,0002,001,000806,912