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:27Elijah KinElijah KinScore: 496,627Success
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:27496,5951,268,404,5031,239,488,0001,999,0002,301,952
2Mar 14, 2026 22:27496,6271,263,734,2451,239,568,0001,999,0002,301,952
3Mar 14, 2026 22:27496,8531,270,891,2461,240,135,0001,998,0002,322,432