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 02:51Victor MerckléVictor MerckléScore: 5,965Success
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 02:525,44522,836,15710,478,0003,136,0002,117,632
2Jun 14, 2026 02:525,49722,793,87210,589,0003,154,0002,117,632
3Jun 14, 2026 02:525,92223,872,99711,674,0003,133,0002,117,632
4Jun 14, 2026 02:525,96024,064,60111,714,0003,188,0002,117,632
5Jun 14, 2026 02:525,96524,078,50911,716,0003,198,0002,117,632
6Jun 14, 2026 02:525,99024,166,20511,797,0003,179,0002,117,632
7Jun 14, 2026 02:526,05527,670,61111,953,0003,185,0002,117,632
8Jun 14, 2026 02:526,10924,483,39812,136,0003,137,0002,117,632
9Jun 14, 2026 02:526,11024,468,20012,140,0003,135,0002,117,632