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 listJan 22, 2025 04:05Ian MckibbenIan MckibbenScore: 342,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 04:05342,038886,486,149853,099,0001,997,0002,281,472
2Jan 22, 2025 04:05342,246886,575,929853,616,0001,999,0002,281,472
3Jan 22, 2025 04:05342,282879,814,619855,704,00002,273,280
4Jan 22, 2025 04:05342,543882,250,348854,359,0001,998,0002,273,280
5Jan 22, 2025 04:05342,578879,779,118854,448,0001,998,0002,441,216
6Jan 22, 2025 04:05343,912880,817,532859,780,00002,273,280
7Jan 22, 2025 04:05344,024887,155,383859,061,000998,0002,281,472
8Jan 22, 2025 04:05344,687888,512,700859,718,0001,999,0002,281,472
9Jan 22, 2025 04:05345,568888,310,886862,921,000999,0002,265,088