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 13, 2026 13:02Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 13:03037,677,30526,500,0002,097,0002,117,632pos 0: expected 6 got 83
2Jun 13, 2026 13:03039,046,80927,821,0002,089,0002,117,632pos 0: expected 226 got 46
3Jun 13, 2026 13:03037,623,80226,404,0002,094,0002,117,632pos 0: expected 228 got 48