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:38Victor MerckléVictor MerckléScore: 2,564Success
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:402,51513,859,2724,964,0001,325,0002,113,536
2Jun 1, 2026 11:402,52713,956,7024,986,0001,333,0002,113,536
3Jun 1, 2026 11:402,53013,931,9324,994,0001,333,0002,113,536
4Jun 1, 2026 11:402,53013,889,7054,998,0001,329,0002,113,536
5Jun 1, 2026 11:402,56414,268,4475,055,0001,357,0002,113,536
6Jun 1, 2026 11:402,60114,001,7815,182,0001,321,0002,113,536
7Jun 1, 2026 11:402,60614,010,5885,189,0001,328,0002,113,536
8Jun 1, 2026 11:402,61814,046,6635,223,0001,323,0002,113,536
9Jun 1, 2026 11:402,62514,063,4905,236,0001,327,0002,113,536