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:33limanjun99limanjun99Score: 3,020Success
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:333,01523,785,7815,384,0002,153,0002,293,760
2Apr 13, 2026 15:333,02024,502,0965,393,0002,157,0002,273,280
3Apr 13, 2026 15:333,04728,707,6845,441,0002,176,0002,293,760