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 14, 2026 02:27Victor MerckléVictor MerckléScore: 5,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 02:285,45422,840,93810,500,0003,136,0002,117,632
2Jun 14, 2026 02:285,46022,805,91310,518,0003,133,0002,117,632
3Jun 14, 2026 02:285,47322,857,79610,541,0003,143,0002,117,632
4Jun 14, 2026 02:285,47722,826,44310,543,0003,150,0002,117,632
5Jun 14, 2026 02:285,62123,208,20110,940,0003,113,0002,117,632
6Jun 14, 2026 02:285,80423,615,56611,352,0003,159,0002,117,632
7Jun 14, 2026 02:285,89323,894,58311,617,0003,117,0002,117,632
8Jun 14, 2026 02:285,90823,923,24111,607,0003,165,0002,117,632
9Jun 14, 2026 02:285,95024,762,12511,742,0003,133,0002,117,632