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 05:47Yuriy LyfenkoYuriy LyfenkoScore: 40,549Success
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 05:4740,331126,582,87595,836,0004,991,0002,293,760
2Nov 17, 2025 05:4740,345124,743,16094,872,0005,991,0002,322,432
3Nov 17, 2025 05:4740,365123,903,61892,919,0007,993,0002,482,176
4Nov 17, 2025 05:4740,418128,903,70495,043,0006,002,0002,469,888
5Nov 17, 2025 05:4740,549124,053,14295,350,0006,022,0002,523,136
6Nov 17, 2025 05:4740,644127,409,22196,580,0005,030,0002,490,368
7Nov 17, 2025 05:4740,728131,812,56694,832,0006,987,0002,449,408
8Nov 17, 2025 05:4740,737126,065,98795,852,0005,990,0002,347,008
9Nov 17, 2025 05:4740,806124,441,91495,015,0007,001,0002,473,984