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 28, 2026 00:38Victor MerckléVictor MerckléScore: 2,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 00:392,48316,567,8323,730,0002,478,0002,142,208
2Jun 28, 2026 00:392,49116,563,7623,751,0002,478,0002,142,208
3Jun 28, 2026 00:392,49416,595,1833,752,0002,483,0002,142,208
4Jun 28, 2026 00:392,50916,396,2183,774,0002,499,0002,142,208
5Jun 28, 2026 00:392,51816,056,2783,729,0002,568,0002,142,208
6Jun 28, 2026 00:392,53416,295,5913,794,0002,542,0002,142,208
7Jun 28, 2026 00:392,54616,056,9323,814,0002,552,0002,142,208
8Jun 28, 2026 00:392,61017,167,4664,032,0002,494,0002,142,208
9Jun 28, 2026 00:392,61116,588,8523,908,0002,621,0002,142,208