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 10, 2026 09:08Victor MerckléVictor MerckléScore: 4,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 09:094,57820,152,3609,191,0002,255,0002,142,208
2Jun 10, 2026 09:094,58920,936,2029,190,0002,284,0002,138,112
3Jun 10, 2026 09:094,60220,500,0979,030,0002,477,0002,142,208
4Jun 10, 2026 09:094,62020,909,5609,023,0002,528,0002,138,112
5Jun 10, 2026 09:094,69021,264,0879,484,0002,243,0002,142,208
6Jun 10, 2026 09:094,71820,051,0379,256,0002,541,0002,142,208
7Jun 10, 2026 09:094,73421,224,7319,310,0002,525,0002,142,208
8Jun 10, 2026 09:094,73520,863,7649,573,0002,265,0002,142,208
9Jun 10, 2026 09:094,73821,733,0049,516,0002,329,0002,142,208