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 9, 2026 02:00Elijah KinElijah KinScore: 2,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 02:012,02014,335,9183,825,0001,227,0002,117,632
2Jun 9, 2026 02:012,02214,275,9483,823,0001,233,0002,117,632
3Jun 9, 2026 02:012,03614,207,7583,843,0001,247,0002,117,632
4Jun 9, 2026 02:012,19014,572,3734,214,0001,261,0002,117,632
5Jun 9, 2026 02:012,23114,728,3054,334,0001,245,0002,117,632
6Jun 9, 2026 02:012,26714,705,6584,420,0001,249,0002,117,632
7Jun 9, 2026 02:012,28814,827,2224,465,0001,257,0002,117,632
8Jun 9, 2026 02:012,32314,866,8654,560,0001,248,0002,117,632
9Jun 9, 2026 02:012,33614,925,5574,592,0001,248,0002,117,632