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 listAug 29, 2026 14:35Victor MerckléVictor MerckléScore: 1,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:441,59512,400,9362,902,0001,086,0002,117,632stderr
2Aug 29, 2026 14:441,60012,423,3732,909,0001,092,0002,117,632stderr
3Aug 29, 2026 14:441,63413,848,5133,007,0001,078,0002,117,632stderr
4Aug 29, 2026 14:441,63612,598,5763,016,0001,074,0002,117,632stderr
5Aug 29, 2026 14:441,63712,455,5163,013,0001,081,0002,117,632stderr
6Aug 29, 2026 14:441,64312,437,8623,045,0001,063,0002,117,632stderr
7Aug 29, 2026 14:441,65612,539,0993,071,0001,071,0002,117,632stderr
8Aug 29, 2026 14:441,69112,613,7303,114,0001,115,0002,117,632stderr
9Aug 29, 2026 14:441,83013,072,3753,492,0001,084,0002,117,632stderr