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 listJul 5, 2026 17:25Victor MerckléVictor MerckléScore: 1,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:271,60612,200,9352,879,0001,138,0002,117,632stderr
2Jul 5, 2026 17:271,62812,143,0342,929,0001,143,0002,117,632stderr
3Jul 5, 2026 17:271,66012,134,9122,964,0001,188,0002,117,632stderr
4Jul 5, 2026 17:271,70514,833,1152,934,0001,329,0002,117,632stderr
5Jul 5, 2026 17:271,71312,284,3412,960,0001,323,0002,117,632stderr
6Jul 5, 2026 17:271,74512,378,4973,016,0001,348,0002,117,632stderr
7Jul 5, 2026 17:271,74612,398,2943,028,0001,338,0002,117,632stderr
8Jul 5, 2026 17:271,74612,394,4433,153,0001,212,0002,117,632stderr
9Jul 5, 2026 17:271,75312,397,2683,173,0001,210,0002,117,632stderr