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 14, 2026 22:24Victor MerckléVictor MerckléScore: 1,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 22:351,38912,261,9931,910,0001,563,0002,117,632stderr
2Sep 14, 2026 22:351,43012,191,7752,416,0001,159,0002,117,632stderr
3Sep 14, 2026 22:351,45312,337,3292,078,0001,556,0002,117,632stderr
4Sep 14, 2026 22:351,46512,403,6812,526,0001,138,0002,117,632stderr
5Sep 14, 2026 22:351,47012,387,9712,132,0001,545,0002,117,632stderr
6Sep 14, 2026 22:351,51921,565,5432,617,0001,181,0002,117,632stderr
7Sep 14, 2026 22:351,52018,899,9552,447,0001,353,0002,117,632stderr
8Sep 14, 2026 22:351,54120,383,8732,168,0001,686,0002,117,632stderr
9Sep 14, 2026 22:351,61822,567,4592,754,0001,292,0002,117,632stderr