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 13, 2026 18:53Victor MerckléVictor MerckléScore: 28,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 18:5328,60280,531,50469,458,0002,049,0002,117,632
2Jun 13, 2026 18:5328,60880,594,78069,442,0002,079,0002,117,632
3Jun 13, 2026 18:5328,60980,739,61569,483,0002,040,0002,117,632
4Jun 13, 2026 18:5328,61180,566,59669,455,0002,073,0002,117,632
5Jun 13, 2026 18:5328,63880,647,78669,513,0002,083,0002,117,632
6Jun 13, 2026 18:5328,77880,956,06769,916,0002,031,0002,117,632
7Jun 13, 2026 18:5328,84581,154,09370,077,0002,036,0002,117,632
8Jun 13, 2026 18:5328,90581,306,64370,229,0002,035,0002,117,632
9Jun 13, 2026 18:5329,16281,946,15470,875,0002,030,0002,117,632