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 19:39olliecrowolliecrowScore: 15,917Success
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 19:3915,87765,528,74135,621,0004,071,0002,396,160
2Mar 4, 2026 19:3915,91766,872,81734,818,0004,974,0002,400,256
3Mar 4, 2026 19:3915,95672,891,91536,899,0002,991,0002,285,568