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 listJun 2, 2026 22:18Victor MerckléVictor MerckléScore: 1,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 22:191,71811,924,8763,080,0001,215,0002,113,536
2Jun 2, 2026 22:191,72211,971,3953,093,0001,212,0002,113,536
3Jun 2, 2026 22:191,73411,967,4133,116,0001,219,0002,113,536
4Jun 2, 2026 22:191,73812,029,4663,123,0001,223,0002,113,536
5Jun 2, 2026 22:191,82312,409,1753,345,0001,213,0002,113,536
6Jun 2, 2026 22:191,83212,419,2783,359,0001,223,0002,113,536
7Jun 2, 2026 22:191,86812,643,2783,454,0001,218,0002,113,536
8Jun 2, 2026 22:191,87112,300,6863,454,0001,224,0002,113,536
9Jun 2, 2026 22:191,89412,376,3753,506,0001,230,0002,113,536