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 30, 2026 18:11Victor MerckléVictor MerckléScore: 1,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:131,63911,980,6152,927,0001,172,0002,117,632stderr
2Jun 30, 2026 18:131,64512,026,5462,939,0001,174,0002,117,632stderr
3Jun 30, 2026 18:131,65012,045,8932,947,0001,178,0002,117,632stderr
4Jun 30, 2026 18:131,66612,058,9812,970,0001,195,0002,117,632stderr
5Jun 30, 2026 18:131,68612,097,3313,013,0001,204,0002,117,632stderr
6Jun 30, 2026 18:131,71512,207,5523,094,0001,195,0002,117,632stderr
7Jun 30, 2026 18:131,72312,218,3953,121,0001,187,0002,117,632stderr
8Jun 30, 2026 18:131,79012,807,0303,293,0001,183,0002,117,632stderr
9Jun 30, 2026 18:131,82612,893,4823,373,0001,194,0002,117,632stderr