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 listJul 30, 2026 21:34Andrew TsibinAndrew TsibinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 21:34013,313,3451,807,0001,510,0002,117,632pos 0: expected 192 got 65
2Jul 30, 2026 21:34013,348,5771,853,0001,539,0002,117,632pos 0: expected 30 got 193
3Jul 30, 2026 21:34013,461,2891,850,0001,548,0002,117,632pos 0: expected 207 got 107