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 12, 2026 13:39limanjun99limanjun99Score: 73,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 13:3973,807216,618,697180,507,0004,011,000905,216
2Apr 12, 2026 13:3973,862209,846,200180,641,0004,014,000765,952
3Apr 12, 2026 13:3973,890212,199,492181,730,0002,995,000720,896