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 1, 2026 13:03Victor MerckléVictor MerckléScore: 2,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 13:052,52013,908,6484,970,0001,330,0002,113,536
2Jun 1, 2026 13:052,52613,872,8254,985,0001,331,0002,113,536
3Jun 1, 2026 13:052,53913,911,8285,015,0001,334,0002,113,536
4Jun 1, 2026 13:052,55313,901,2215,051,0001,332,0002,113,536
5Jun 1, 2026 13:052,56314,005,9965,067,0001,341,0002,113,536
6Jun 1, 2026 13:052,56814,001,9545,096,0001,325,0002,113,536
7Jun 1, 2026 13:052,56913,957,0105,096,0001,328,0002,113,536
8Jun 1, 2026 13:052,60214,040,5565,187,0001,320,0002,113,536
9Jun 1, 2026 13:052,62114,048,3845,226,0001,327,0002,113,536