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 15:58Victor MerckléVictor MerckléScore: 2,224Success
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 16:002,14213,031,8384,115,0001,241,0002,113,536
2Jun 2, 2026 16:002,14314,263,5144,120,0001,239,0002,113,536
3Jun 2, 2026 16:002,18013,158,5274,189,0001,263,0002,113,536
4Jun 2, 2026 16:002,18313,103,5924,210,0001,248,0002,113,536
5Jun 2, 2026 16:002,22413,171,4494,310,0001,252,0002,113,536
6Jun 2, 2026 16:002,22813,207,2744,324,0001,246,0002,113,536
7Jun 2, 2026 16:002,23213,227,2824,326,0001,255,0002,113,536
8Jun 2, 2026 16:002,24013,244,9734,355,0001,247,0002,113,536
9Jun 2, 2026 16:002,24413,230,9704,355,0001,255,0002,113,536