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 10, 2026 09:03Victor 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 10, 2026 09:03019,294,2027,535,0002,341,0002,138,112pos 0: expected 176 got 179
2Jun 10, 2026 09:03018,454,4117,053,0002,236,0002,138,112pos 0: expected 103 got 106
3Jun 10, 2026 09:03016,830,2747,062,0002,233,0002,142,208pos 0: expected 10 got 13