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:10Victor MerckléVictor MerckléScore: 2,611Success
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:122,51413,875,4964,962,0001,325,0002,113,536
2Jun 1, 2026 11:122,52013,850,2444,973,0001,328,0002,113,536
3Jun 1, 2026 11:122,52513,889,9184,982,0001,331,0002,113,536
4Jun 1, 2026 11:122,54213,898,5475,013,0001,342,0002,113,536
5Jun 1, 2026 11:122,61114,022,1335,204,0001,324,0002,113,536
6Jun 1, 2026 11:122,61314,086,1005,209,0001,324,0002,113,536
7Jun 1, 2026 11:122,61814,122,0845,217,0001,328,0002,113,536
8Jun 1, 2026 11:122,62714,156,8095,239,0001,329,0002,113,536
9Jun 1, 2026 11:122,64114,498,3625,268,0001,336,0002,113,536