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 3, 2026 23:27Elijah KinElijah KinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 23:28016,429,7426,202,0001,173,0002,117,632pos 0: expected 130 got 0
2Jun 3, 2026 23:28016,928,3916,290,0001,149,0002,117,632pos 0: expected 114 got 0
3Jun 3, 2026 23:28016,266,6466,090,0001,113,0002,117,632pos 0: expected 8 got 0