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 14, 2025 17:54izotoffizotoffScore: 33,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 17:5433,883110,962,71883,700,0001,008,0002,383,872
2Nov 14, 2025 17:5433,883111,962,01182,692,0002,016,0002,396,160
3Nov 14, 2025 17:5433,892111,098,32984,731,00002,367,488
4Nov 14, 2025 17:5433,893117,149,45583,724,0001,008,0002,396,160
5Nov 14, 2025 17:5433,933112,138,66783,834,000998,0002,519,040
6Nov 14, 2025 17:5433,995114,058,58981,988,0002,999,0002,519,040
7Nov 14, 2025 17:5434,191107,364,62382,461,0003,016,0002,539,520
8Nov 14, 2025 17:5434,350110,269,74384,878,000998,0002,523,136
9Nov 14, 2025 17:5434,380109,295,06883,953,0001,998,0002,523,136