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 14:32limanjun99limanjun99Score: 38,612Success
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 14:3238,552122,425,32292,366,0004,015,000712,704
2Apr 12, 2026 14:3238,612124,399,58895,524,0001,005,000782,336
3Apr 12, 2026 14:3238,803124,409,33493,008,0004,000,000864,256