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 15:45Victor MerckléVictor MerckléScore: 2,552Success
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 15:472,49613,847,7014,910,0001,331,0002,113,536
2Jun 1, 2026 15:472,50113,869,8494,921,0001,332,0002,113,536
3Jun 1, 2026 15:472,51013,853,1244,940,0001,335,0002,113,536
4Jun 1, 2026 15:472,51613,854,1204,955,0001,337,0002,113,536
5Jun 1, 2026 15:472,55213,902,7715,020,0001,360,0002,113,536
6Jun 1, 2026 15:472,60213,967,9775,172,0001,333,0002,113,536
7Jun 1, 2026 15:472,60313,991,1635,172,0001,336,0002,113,536
8Jun 1, 2026 15:472,61724,453,6015,208,0001,336,0002,109,440
9Jun 1, 2026 15:472,61814,026,1545,201,0001,344,0002,113,536