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 30, 2026 21:51Victor MerckléVictor MerckléScore: 1,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:531,60312,004,3732,869,0001,139,0002,117,632stderr
2Jun 30, 2026 21:531,60713,028,7492,870,0001,149,0002,117,632stderr
3Jun 30, 2026 21:531,60912,008,9382,882,0001,141,0002,117,632stderr
4Jun 30, 2026 21:531,64112,019,5002,935,0001,169,0002,117,632stderr
5Jun 30, 2026 21:531,64611,994,7802,944,0001,171,0002,117,632stderr
6Jun 30, 2026 21:531,67612,125,9013,033,0001,157,0002,117,632stderr
7Jun 30, 2026 21:531,75412,505,3103,182,0001,205,0002,117,632stderr
8Jun 30, 2026 21:531,75612,295,1553,184,0001,207,0002,117,632stderr
9Jun 30, 2026 21:531,75912,695,2573,181,0001,217,0002,117,632stderr