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 16, 2026 17:26Andrew 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 16, 2026 17:26010,712,4341,269,00002,117,632pos 0: expected 153 got 45
2Jul 16, 2026 17:26010,657,2081,300,00002,117,632pos 0: expected 158 got 45
3Jul 16, 2026 17:26010,842,3831,081,00002,117,632pos 0: expected 196 got 50