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 1, 2026 16:30Victor MerckléVictor MerckléScore: 2,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 16:312,52513,888,2624,985,0001,329,0002,113,536
2Jun 1, 2026 16:312,52713,904,5384,988,0001,330,0002,113,536
3Jun 1, 2026 16:312,53113,861,8214,997,0001,331,0002,113,536
4Jun 1, 2026 16:312,54413,972,5585,028,0001,334,0002,113,536
5Jun 1, 2026 16:312,57914,034,2575,124,0001,324,0002,113,536
6Jun 1, 2026 16:312,61314,071,2315,202,0001,332,0002,113,536
7Jun 1, 2026 16:312,61614,166,0975,212,0001,328,0002,113,536
8Jun 1, 2026 16:312,62614,118,8795,232,0001,333,0002,113,536
9Jun 1, 2026 16:312,63214,116,1735,251,0001,329,0002,113,536