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 listSep 4, 2026 07:44Victor MerckléVictor MerckléScore: 1,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:001,47811,949,6772,623,0001,072,0002,117,632stderr
2Sep 4, 2026 08:001,48411,920,6422,639,0001,071,0002,117,632stderr
3Sep 4, 2026 08:001,48612,104,6502,636,0001,079,0002,117,632stderr
4Sep 4, 2026 08:001,49611,959,8162,649,0001,093,0002,117,632stderr
5Sep 4, 2026 08:001,49811,985,0172,665,0001,082,0002,117,632stderr
6Sep 4, 2026 08:001,50512,138,4342,664,0001,099,0002,117,632stderr
7Sep 4, 2026 08:001,58612,170,4842,829,0001,137,0002,117,632stderr
8Sep 4, 2026 08:001,59412,846,9692,857,0001,128,0002,117,632stderr
9Sep 4, 2026 08:001,63412,463,7792,960,0001,126,0002,117,632stderr