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 10, 2026 05:07olliecrowolliecrowScore: 21,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:0721,39876,777,90149,458,0004,037,0002,334,720
2Mar 10, 2026 05:0721,40978,207,23949,483,0004,039,0002,285,568
3Mar 10, 2026 05:0721,49884,669,22152,730,0001,014,0002,379,776