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 11:20Victor MerckléVictor MerckléScore: 2,575Success
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 11:222,51213,887,6334,953,0001,327,0002,113,536
2Jun 1, 2026 11:222,51713,856,0954,971,0001,323,0002,113,536
3Jun 1, 2026 11:222,52013,838,9154,975,0001,326,0002,113,536
4Jun 1, 2026 11:222,56713,944,8755,095,0001,323,0002,113,536
5Jun 1, 2026 11:222,57513,983,0825,071,0001,368,0002,113,536
6Jun 1, 2026 11:222,60913,991,5595,198,0001,325,0002,113,536
7Jun 1, 2026 11:222,61814,125,0825,224,0001,323,0002,113,536
8Jun 1, 2026 11:222,62514,138,1205,238,0001,326,0002,113,536
9Jun 1, 2026 11:222,63314,286,8895,251,0001,333,0002,113,536