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 17:14Yuriy LyfenkoYuriy LyfenkoScore: 24,966Success
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 17:1424,93288,723,77758,308,0004,021,0002,310,144
2Nov 17, 2025 17:1424,96685,098,44659,394,0003,020,0002,273,280
3Nov 17, 2025 17:1425,69487,408,85060,221,0004,014,0002,437,120