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 listJun 14, 2026 01:49Victor MerckléVictor MerckléScore: 6,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 01:496,08424,337,04911,985,0003,225,0002,117,632
2Jun 14, 2026 01:496,14824,621,61312,160,0003,211,0002,117,632
3Jun 14, 2026 01:496,15424,546,16712,184,0003,201,0002,117,632
4Jun 14, 2026 01:496,21424,707,05212,333,0003,202,0002,117,632
5Jun 14, 2026 01:496,22025,076,86712,342,0003,210,0002,117,632
6Jun 14, 2026 01:496,22726,038,96512,376,0003,193,0002,117,632
7Jun 14, 2026 01:496,30024,945,87012,543,0003,208,0002,117,632
8Jun 14, 2026 01:496,32824,957,81712,562,0003,259,0002,117,632
9Jun 14, 2026 01:496,33325,310,75412,638,0003,195,0002,117,632