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 14, 2026 17:54marko1597marko1597Score: 2,456Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:36Tomislav Tunkovic10.03CustomSolution Held
Sep 9, 2026 12:33Tomislav Tunkovic10.03CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:552,42714,334,5964,884,0001,184,0002,117,632
2Aug 14, 2026 17:552,44314,349,0344,916,0001,193,0002,117,632
3Aug 14, 2026 17:552,44614,554,6114,924,0001,191,0002,117,632
4Aug 14, 2026 17:552,44814,415,8804,926,0001,194,0002,117,632
5Aug 14, 2026 17:552,45614,342,0954,928,0001,213,0002,117,632
6Aug 14, 2026 17:552,46014,306,2084,940,0001,212,0002,117,632
7Aug 14, 2026 17:552,49614,606,4884,995,0001,246,0002,117,632
8Aug 14, 2026 17:552,51222,647,3225,053,0001,227,0002,117,632
9Aug 14, 2026 17:552,52514,661,6155,163,0001,150,0002,117,632