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 5, 2026 01:25Victor MerckléVictor MerckléScore: 1,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 01:311,45112,051,7532,565,0001,063,0002,117,632stderr
2Sep 5, 2026 01:311,52212,088,4812,678,0001,128,0002,117,632stderr
3Sep 5, 2026 01:311,56713,117,1892,775,0001,143,0002,117,632stderr
4Sep 5, 2026 01:311,57012,377,3052,704,0001,222,0002,117,632stderr
5Sep 5, 2026 01:311,57513,099,9432,786,0001,153,0002,117,632stderr
6Sep 5, 2026 01:311,57512,193,7492,762,0001,177,0002,117,632stderr
7Sep 5, 2026 01:311,57713,073,7912,798,0001,145,0002,117,632stderr
8Sep 5, 2026 01:311,57913,062,0662,804,0001,144,0002,117,632stderr
9Sep 5, 2026 01:311,60013,144,6442,777,0001,223,0002,117,632stderr