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 17, 2026 01:56Victor MerckléVictor MerckléScore: 3,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:173,37418,131,9695,926,0002,510,0002,142,208stderr
2Aug 17, 2026 02:173,38218,170,2195,942,0002,514,0002,142,208stderr
3Aug 17, 2026 02:173,44818,278,1766,106,0002,515,0002,142,208stderr
4Aug 17, 2026 02:173,47318,365,2006,447,0002,237,0002,142,208stderr
5Aug 17, 2026 02:173,47918,434,4316,485,0002,214,0002,142,208stderr
6Aug 17, 2026 02:173,48018,415,6876,469,0002,233,0002,142,208stderr
7Aug 17, 2026 02:173,51218,531,8416,226,0002,556,0002,142,208stderr
8Aug 17, 2026 02:173,52318,490,2266,530,0002,279,0002,142,208stderr
9Aug 17, 2026 02:173,54318,482,8996,580,0002,279,0002,142,208stderr