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 7, 2026 17:45Victor MerckléVictor MerckléScore: 3,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:483,25817,531,5015,485,0002,662,0002,142,208stderr
2Jul 7, 2026 17:483,26817,511,0585,503,0002,668,0002,138,112stderr
3Jul 7, 2026 17:483,27117,555,5975,506,0002,673,0002,142,208stderr
4Jul 7, 2026 17:483,29317,516,5805,915,0002,319,0002,142,208stderr
5Jul 7, 2026 17:483,31217,552,9805,955,0002,325,0002,138,112stderr
6Jul 7, 2026 17:483,31517,672,5775,613,0002,675,0002,142,208stderr
7Jul 7, 2026 17:483,33517,707,0795,312,0003,027,0002,195,456stderr
8Jul 7, 2026 17:483,34819,727,6596,171,0002,200,0002,142,208stderr
9Jul 7, 2026 17:483,35117,758,6266,149,0002,229,0002,142,208stderr