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:12Yuriy LyfenkoYuriy LyfenkoScore: 40,731Success
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:1240,667127,083,98793,615,0008,052,0002,478,080
2Nov 17, 2025 06:1240,731131,627,38492,844,0008,984,0002,273,280
3Nov 17, 2025 06:1240,888129,833,80494,203,0008,017,0002,404,352