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 listAug 4, 2026 00:19Victor MerckléVictor MerckléScore: 3,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 00:223,35418,107,8796,186,0002,201,0002,142,208stderr
2Aug 4, 2026 00:223,36318,092,9025,884,0002,525,0002,142,208stderr
3Aug 4, 2026 00:223,37418,154,2004,977,0003,459,0002,195,456stderr
4Aug 4, 2026 00:223,37618,173,4336,235,0002,206,0002,142,208stderr
5Aug 4, 2026 00:223,46018,397,5146,433,0002,219,0002,134,016stderr
6Aug 4, 2026 00:223,48418,435,4526,395,0002,317,0002,142,208stderr
7Aug 4, 2026 00:223,51018,464,7196,520,0002,256,0002,142,208stderr
8Aug 4, 2026 00:223,51418,538,9266,462,0002,325,0002,134,016stderr
9Aug 4, 2026 00:223,56018,734,4656,560,0002,340,0002,142,208stderr