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:58Victor MerckléVictor MerckléScore: 29,494Success
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:5829,17682,003,32270,847,0002,094,0002,117,632
2Jun 13, 2026 18:5829,20682,072,31470,973,0002,043,0002,117,632
3Jun 13, 2026 18:5829,22482,141,75571,017,0002,045,0002,117,632
4Jun 13, 2026 18:5829,47082,679,00471,587,0002,090,0002,117,632
5Jun 13, 2026 18:5829,49482,863,33671,688,0002,049,0002,117,632
6Jun 13, 2026 18:5829,53582,762,40871,761,0002,077,0002,117,632
7Jun 13, 2026 18:5829,62083,095,03471,982,0002,070,0002,117,632
8Jun 13, 2026 18:5829,63883,054,74672,040,0002,055,0002,117,632
9Jun 13, 2026 18:5829,65483,148,36072,106,0002,030,0002,117,632