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 10, 2026 16:03Victor MerckléVictor MerckléScore: 1,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 16:041,44212,172,4532,525,0001,081,0002,117,632stderr
2Sep 10, 2026 16:041,48912,341,1832,621,0001,102,0002,117,632stderr
3Sep 10, 2026 16:041,53212,281,1502,692,0001,138,0002,117,632stderr
4Sep 10, 2026 16:041,54012,354,3232,709,0001,143,0002,117,632stderr
5Sep 10, 2026 16:041,54412,372,8122,728,0001,134,0002,117,632stderr
6Sep 10, 2026 16:041,55312,271,3442,743,0001,141,0002,117,632stderr
7Sep 10, 2026 16:041,55712,473,4552,738,0001,156,0002,117,632stderr
8Sep 10, 2026 16:041,59713,304,9862,866,0001,128,0002,117,632stderr
9Sep 10, 2026 16:041,60412,704,3542,882,0001,129,0002,117,632stderr