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 29, 2026 00:14Victor 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 29, 2026 00:16019,431,1076,851,0003,305,0002,129,920pos 0: expected 216 got 156
2Jun 29, 2026 00:16020,051,3177,081,0003,614,0002,129,920pos 0: expected 138 got 246
3Jun 29, 2026 00:16019,758,0266,772,0003,697,0002,129,920pos 0: expected 194 got 156