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:15Victor MerckléVictor MerckléScore: 5,649Success
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:165,50922,906,41410,595,0003,179,0002,117,632
2Jun 14, 2026 02:165,51622,893,47610,650,0003,141,0002,117,632
3Jun 14, 2026 02:165,59423,193,19210,820,0003,167,0002,117,632
4Jun 14, 2026 02:165,63423,310,56810,954,0003,132,0002,117,632
5Jun 14, 2026 02:165,64923,276,61110,965,0003,159,0002,117,632
6Jun 14, 2026 02:165,70923,433,66311,143,0003,131,0002,117,632
7Jun 14, 2026 02:165,92624,285,84111,675,0003,140,0002,117,632
8Jun 14, 2026 02:165,93523,938,15311,701,0003,138,0002,117,632
9Jun 14, 2026 02:166,07224,287,71912,002,0003,178,0002,117,632