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:02Yuriy LyfenkoYuriy LyfenkoScore: 40,616Success
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:0240,492124,546,35495,217,0006,013,0002,326,528
2Nov 17, 2025 06:0240,616131,452,39895,509,0006,032,0002,478,080
3Nov 17, 2025 06:0240,792131,081,55796,981,0004,999,0002,326,528