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 listSep 10, 2026 08:05Victor MerckléVictor MerckléScore: 3,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 08:052,94316,064,5346,270,0001,088,0002,117,632stderr
2Sep 10, 2026 08:052,94517,579,7056,153,0001,210,0002,117,632stderr
3Sep 10, 2026 08:052,98416,128,5436,351,0001,111,0002,117,632stderr
4Sep 10, 2026 08:052,98716,200,8516,353,0001,115,0002,117,632stderr
5Sep 10, 2026 08:053,02616,291,3986,440,0001,126,0002,117,632stderr
6Sep 10, 2026 08:053,03816,380,1486,473,0001,123,0002,117,632stderr
7Sep 10, 2026 08:053,04316,318,1226,468,0001,140,0002,117,632stderr
8Sep 10, 2026 08:053,04816,308,6876,480,0001,140,0002,117,632stderr
9Sep 10, 2026 08:053,05316,406,7276,507,0001,127,0002,117,632stderr