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:08Victor 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:08037,748,94026,524,0002,102,0002,117,632pos 0: expected 33 got 111
2Jun 13, 2026 13:08038,684,09627,371,0002,051,0002,117,632pos 0: expected 204 got 26
3Jun 13, 2026 13:08038,056,94526,732,0002,114,0002,117,632pos 0: expected 84 got 160