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 14, 2026 07:45Victor MerckléVictor MerckléScore: 1,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 07:581,76712,018,4793,153,0001,265,0002,117,632
2Jun 14, 2026 07:581,78211,958,4393,190,0001,266,0002,117,632
3Jun 14, 2026 07:581,83219,666,9603,240,0001,341,0002,117,632
4Jun 14, 2026 07:581,85212,160,1243,352,0001,279,0002,117,632
5Jun 14, 2026 07:581,85312,227,1213,369,0001,265,0002,117,632
6Jun 14, 2026 07:581,87012,162,2923,402,0001,275,0002,117,632
7Jun 14, 2026 07:581,88212,359,4363,424,0001,283,0002,117,632
8Jun 14, 2026 07:581,92212,341,7073,473,0001,333,0002,117,632
9Jun 14, 2026 07:581,92412,244,3173,500,0001,312,0002,117,632