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 30, 2026 22:01Victor MerckléVictor MerckléScore: 1,790Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:031,74212,375,8393,222,0001,133,0002,117,632stderr
2Jun 30, 2026 22:031,74912,444,8443,227,0001,147,0002,117,632stderr
3Jun 30, 2026 22:031,75612,769,6663,001,0001,390,0002,117,632stderr
4Jun 30, 2026 22:031,75712,481,0893,237,0001,156,0002,117,632stderr
5Jun 30, 2026 22:031,79018,426,6633,332,0001,144,0002,117,632stderr
6Jun 30, 2026 22:031,83712,565,5853,461,0001,133,0002,117,632stderr
7Jun 30, 2026 22:031,84313,013,6583,467,0001,142,0002,117,632stderr
8Jun 30, 2026 22:031,87213,170,6373,464,0001,218,0002,117,632stderr
9Jun 30, 2026 22:031,88713,048,9973,543,0001,175,0002,117,632stderr