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:13Victor MerckléVictor MerckléScore: 3,128Success
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 01:263,06217,400,2035,365,0002,292,0002,142,208stderr
2Aug 17, 2026 01:263,07417,374,5775,390,0002,297,0002,142,208stderr
3Aug 17, 2026 01:263,10317,733,9274,770,0002,988,0002,195,456stderr
4Aug 17, 2026 01:263,10817,441,6005,499,0002,272,0002,142,208stderr
5Aug 17, 2026 01:263,12817,467,4435,475,0002,346,0002,142,208stderr
6Aug 17, 2026 01:263,12817,985,6865,496,0002,325,0002,142,208stderr
7Aug 17, 2026 01:263,13017,915,3155,488,0002,339,0002,142,208stderr
8Aug 17, 2026 01:263,14417,491,9815,508,0002,354,0002,142,208stderr
9Aug 17, 2026 01:263,14717,634,0345,509,0002,360,0002,142,208stderr