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 16, 2026 02:23Victor MerckléVictor MerckléScore: 1,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 02:261,73111,623,2503,111,0001,218,0002,113,536
2Jun 16, 2026 02:261,76311,847,6493,176,0001,232,0002,113,536
3Jun 16, 2026 02:261,86112,026,4543,436,0001,218,0002,113,536
4Jun 16, 2026 02:261,86912,004,5443,456,0001,218,0002,113,536
5Jun 16, 2026 02:261,86912,048,5983,452,0001,222,0002,113,536
6Jun 16, 2026 02:261,88012,053,1293,426,0001,274,0002,113,536
7Jun 16, 2026 02:261,90212,133,7913,439,0001,318,0002,113,536
8Jun 16, 2026 02:261,90311,980,8123,523,0001,236,0002,113,536
9Jun 16, 2026 02:261,90412,180,0123,086,0001,675,0002,113,536