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:44Victor 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:44054,089,09940,826,0004,155,0002,117,632pos 0: expected 82 got 159
2Jun 13, 2026 19:44054,323,92341,061,0004,085,0002,117,632pos 0: expected 33 got 110
3Jun 13, 2026 19:44055,385,29042,027,0004,140,0002,117,632pos 0: expected 202 got 23