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 15, 2026 10:12Victor MerckléVictor MerckléScore: 1,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 10:131,34713,324,5261,851,0001,518,0002,117,632stderr
2Sep 15, 2026 10:131,35513,246,8481,851,0001,537,0002,117,632stderr
3Sep 15, 2026 10:131,36113,289,9561,876,0001,528,0002,117,632stderr
4Sep 15, 2026 10:131,36413,240,0411,864,0001,547,0002,117,632stderr
5Sep 15, 2026 10:131,38113,225,0051,885,0001,568,0002,117,632stderr
6Sep 15, 2026 10:131,39913,231,0371,931,0001,568,0002,117,632stderr
7Sep 15, 2026 10:131,43913,535,7541,985,0001,613,0002,117,632stderr
8Sep 15, 2026 10:131,48814,779,6662,122,0001,598,0002,117,632stderr
9Sep 15, 2026 10:131,49213,397,5372,141,0001,589,0002,117,632stderr