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 listNov 17, 2025 06:13Yuriy LyfenkoYuriy LyfenkoScore: 42,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 06:1342,650134,616,368102,601,0004,023,0002,273,280
2Nov 17, 2025 06:1342,722131,430,07899,818,0006,987,0002,473,984
3Nov 17, 2025 06:1344,041135,611,976104,098,0006,005,0002,473,984