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 4, 2026 18:02olliecrowolliecrowScore: 24,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:0224,44484,295,51153,095,0008,014,0002,486,272
2Mar 4, 2026 18:0224,62988,105,90553,498,0008,075,0002,285,568
3Mar 4, 2026 18:0224,81086,190,84153,021,0009,003,0002,281,472