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 20:12Victor MerckléVictor MerckléScore: 1,644Success
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 20:141,59911,998,2942,858,0001,141,0002,117,632stderr
2Jun 30, 2026 20:141,63111,969,2482,917,0001,162,0002,117,632stderr
3Jun 30, 2026 20:141,63312,078,3622,926,0001,158,0002,117,632stderr
4Jun 30, 2026 20:141,63611,968,3632,929,0001,163,0002,117,632stderr
5Jun 30, 2026 20:141,64412,050,6372,931,0001,181,0002,117,632stderr
6Jun 30, 2026 20:141,67212,031,1562,994,0001,187,0002,117,632stderr
7Jun 30, 2026 20:141,67212,049,1432,988,0001,192,0002,117,632stderr
8Jun 30, 2026 20:141,71412,213,9763,062,0001,225,0002,117,632stderr
9Jun 30, 2026 20:141,73212,285,2493,124,0001,207,0002,117,632stderr