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 8, 2026 00:40Victor MerckléVictor MerckléScore: 3,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 00:443,40117,839,3616,279,0002,224,0002,142,208stderr
2Jul 8, 2026 00:443,40817,906,1346,325,0002,197,0002,134,016stderr
3Jul 8, 2026 00:443,41317,855,4805,168,0003,366,0002,195,456stderr
4Jul 8, 2026 00:443,43317,894,3646,314,0002,269,0002,142,208stderr
5Jul 8, 2026 00:443,46918,027,3836,488,0002,185,0002,134,016stderr
6Jul 8, 2026 00:443,48718,062,4936,209,0002,510,0002,134,016stderr
7Jul 8, 2026 00:443,49618,064,1266,525,0002,215,0002,142,208stderr
8Jul 8, 2026 00:443,49918,056,4126,540,0002,208,0002,134,016stderr
9Jul 8, 2026 00:443,50818,232,2066,514,0002,258,0002,142,208stderr