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 21, 2026 19:52Dominique GarmierDominique GarmierScore: 2,199,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:522,198,8855,522,695,5585,493,215,0003,997,0002,355,200
2Mar 21, 2026 19:522,199,3685,524,048,0725,496,422,0001,998,0002,539,520
3Mar 21, 2026 19:522,199,4265,522,930,2805,496,567,0001,999,0002,437,120