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 14, 2026 07:30Victor MerckléVictor MerckléScore: 1,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 07:321,64712,209,8833,004,0001,114,0002,117,632stderr
2Jul 14, 2026 07:321,71212,389,2043,134,0001,147,0002,117,632stderr
3Jul 14, 2026 07:321,74112,456,6683,230,0001,123,0002,117,632stderr
4Jul 14, 2026 07:321,74312,812,2493,214,0001,144,0002,117,632stderr
5Jul 14, 2026 07:321,74713,049,5493,220,0001,148,0002,117,632stderr
6Jul 14, 2026 07:321,75013,094,1513,222,0001,153,0002,117,632stderr
7Jul 14, 2026 07:321,75013,014,6703,229,0001,147,0002,117,632stderr
8Jul 14, 2026 07:321,76713,135,5483,218,0001,200,0002,117,632stderr
9Jul 14, 2026 07:321,79313,125,0373,299,0001,185,0002,117,632stderr