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:37Elijah KinElijah KinScore: 496,748Success
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:37496,1891,264,101,1341,238,473,0001,999,0002,301,952
2Mar 14, 2026 22:37496,7481,268,794,7391,239,872,0001,999,0002,301,952
3Mar 14, 2026 22:37496,8421,270,754,0951,240,106,0001,998,0002,301,952