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 listApr 13, 2026 13:49limanjun99limanjun99Score: 3,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 13:493,07725,439,3965,495,0002,198,0002,293,760
2Apr 13, 2026 13:493,11627,054,9995,565,0002,226,0002,293,760
3Apr 13, 2026 13:493,19925,819,3295,998,0001,999,0002,293,760