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 19:39Victor 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 19:39056,247,52842,880,0004,154,0002,117,632pos 0: expected 100 got 176
2Jun 13, 2026 19:39052,769,43039,567,0004,079,0002,117,632pos 0: expected 4 got 80
3Jun 13, 2026 19:39053,591,40839,665,0004,165,0002,117,632pos 0: expected 220 got 40