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 listMay 29, 2026 18:52Victor MerckléVictor MerckléScore: 2,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 18:542,57215,650,5765,125,0001,307,0002,113,536
2May 29, 2026 18:542,57414,261,3975,124,0001,311,0002,113,536
3May 29, 2026 18:542,59215,820,0815,168,0001,313,0002,113,536
4May 29, 2026 18:542,62814,530,2285,239,0001,331,0002,113,536
5May 29, 2026 18:542,70216,506,6625,449,0001,306,0002,113,536
6May 29, 2026 18:542,70414,555,5205,453,0001,308,0002,113,536
7May 29, 2026 18:542,71614,636,6375,482,0001,308,0002,113,536
8May 29, 2026 18:542,73815,907,4745,530,0001,316,0002,113,536
9May 29, 2026 18:542,75715,875,3825,551,0001,342,0002,113,536