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 listMay 22, 2026 09:41M-RochatM-RochatScore: 4,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:414,59820,875,15610,404,0001,091,0002,117,632
2May 22, 2026 09:414,67420,975,33810,589,0001,097,0002,117,632
3May 22, 2026 09:414,68121,166,45410,604,0001,099,0002,117,632
4May 22, 2026 09:414,68421,563,80910,611,0001,101,0002,117,632
5May 22, 2026 09:414,68421,453,80110,609,0001,103,0002,121,728
6May 22, 2026 09:414,69021,032,60910,626,0001,099,0002,117,632
7May 22, 2026 09:414,69221,052,11810,634,0001,097,0002,117,632
8May 22, 2026 09:414,69520,965,26810,641,0001,098,0002,117,632
9May 22, 2026 09:414,70624,089,49510,664,0001,102,0002,117,632