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 09:30Victor MerckléVictor MerckléScore: 2,593Success
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 09:302,53815,102,8705,142,0001,203,0002,117,632stderr
2Sep 10, 2026 09:302,55915,072,8515,167,0001,231,0002,117,632stderr
3Sep 10, 2026 09:302,56415,146,0905,131,0001,280,0002,117,632stderr
4Sep 10, 2026 09:302,58315,125,6415,358,0001,101,0002,117,632stderr
5Sep 10, 2026 09:302,59315,200,9425,361,0001,123,0002,117,632stderr
6Sep 10, 2026 09:302,60515,356,8665,400,0001,113,0002,117,632stderr
7Sep 10, 2026 09:302,61115,188,3035,414,0001,115,0002,117,632stderr
8Sep 10, 2026 09:302,62415,275,1445,452,0001,109,0002,117,632stderr
9Sep 10, 2026 09:302,62515,220,4825,444,0001,120,0002,117,632stderr