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 listJul 8, 2026 08:42Victor MerckléVictor MerckléScore: 2,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 08:432,61715,622,6404,112,0002,432,0002,146,304stderr
2Jul 8, 2026 08:432,74014,941,5494,145,0002,707,0002,146,304stderr
3Jul 8, 2026 08:432,76214,985,9884,392,0002,514,0002,146,304stderr
4Jul 8, 2026 08:432,81915,815,4724,625,0002,424,0002,146,304stderr
5Jul 8, 2026 08:432,82315,115,9254,654,0002,404,0002,146,304stderr
6Jul 8, 2026 08:432,83215,182,1294,876,0002,205,0002,146,304stderr
7Jul 8, 2026 08:432,83415,768,7624,905,0002,182,0002,146,304stderr
8Jul 8, 2026 08:432,85216,680,0284,866,0002,266,0002,146,304stderr
9Jul 8, 2026 08:432,86015,228,9384,912,0002,238,0002,146,304stderr