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 15:39limanjun99limanjun99Score: 3,010Success
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 15:392,99526,973,2425,349,0002,139,0002,523,136
2Apr 13, 2026 15:393,01029,775,0465,376,0002,150,0002,322,432
3Apr 13, 2026 15:393,01423,410,9895,383,0002,153,0002,293,760