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 08:25Victor MerckléVictor MerckléScore: 1,862Success
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 08:391,75811,878,7063,153,0001,243,0002,117,632
2Jun 14, 2026 08:391,77512,082,9363,132,0001,307,0002,117,632
3Jun 14, 2026 08:391,78312,016,5063,192,0001,267,0002,117,632
4Jun 14, 2026 08:391,85112,176,7623,368,0001,261,0002,117,632
5Jun 14, 2026 08:391,86212,488,9463,395,0001,262,0002,117,632
6Jun 14, 2026 08:391,87512,312,1383,443,0001,246,0002,117,632
7Jun 14, 2026 08:391,88112,347,3313,436,0001,268,0002,117,632
8Jun 14, 2026 08:391,92512,375,6433,447,0001,367,0002,117,632
9Jun 14, 2026 08:391,93912,658,5813,464,0001,384,0002,117,632