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 3, 2026 01:16Victor MerckléVictor MerckléScore: 1,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 01:181,71811,917,8593,086,0001,210,0002,117,632
2Jun 3, 2026 01:181,72111,915,8183,089,0001,214,0002,117,632
3Jun 3, 2026 01:181,72511,948,5703,097,0001,216,0002,117,632
4Jun 3, 2026 01:181,74111,949,8973,131,0001,222,0002,117,632
5Jun 3, 2026 01:181,74411,840,5093,137,0001,225,0002,117,632
6Jun 3, 2026 01:181,74413,256,1643,136,0001,224,0002,117,632
7Jun 3, 2026 01:181,77012,056,1243,212,0001,215,0002,117,632
8Jun 3, 2026 01:181,85912,305,0163,444,0001,205,0002,117,632
9Jun 3, 2026 01:181,88312,464,2363,490,0001,218,0002,117,632