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 03:02Victor MerckléVictor MerckléScore: 5,518Success
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 03:025,45022,812,86110,457,0003,169,0002,117,632
2Jun 14, 2026 03:025,46822,824,63310,515,0003,156,0002,117,632
3Jun 14, 2026 03:025,48022,781,89010,562,0003,140,0002,117,632
4Jun 14, 2026 03:025,49522,854,22210,582,0003,156,0002,117,632
5Jun 14, 2026 03:025,51822,889,33310,630,0003,167,0002,117,632
6Jun 14, 2026 03:025,82223,710,28211,393,0003,163,0002,117,632
7Jun 14, 2026 03:025,83223,784,93811,426,0003,154,0002,117,632
8Jun 14, 2026 03:025,96527,212,56111,794,0003,120,0002,117,632
9Jun 14, 2026 03:026,05324,388,10811,976,0003,157,0002,117,632