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 23:11Victor MerckléVictor MerckléScore: 1,711Success
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 23:131,63812,055,9232,974,0001,121,0002,121,728stderr
2Jun 30, 2026 23:131,65112,102,0422,992,0001,137,0002,121,728stderr
3Jun 30, 2026 23:131,65412,145,8323,011,0001,126,0002,121,728stderr
4Jun 30, 2026 23:131,66112,064,8793,016,0001,138,0002,121,728stderr
5Jun 30, 2026 23:131,71112,193,1633,147,0001,132,0002,121,728stderr
6Jun 30, 2026 23:131,75912,284,1443,333,0001,065,0002,121,728stderr
7Jun 30, 2026 23:131,78212,422,8473,395,0001,062,0002,121,728stderr
8Jun 30, 2026 23:131,78312,379,3353,395,0001,063,0002,121,728stderr
9Jun 30, 2026 23:131,78312,455,9083,394,0001,064,0002,121,728stderr