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 listOct 7, 2026 22:09Karthik ReddyKarthik ReddyScore: 1,434Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 16, 2026 13:55Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 22:101,41712,430,5762,297,0001,246,000524,288
2Oct 7, 2026 22:101,42612,431,5522,313,0001,254,000524,288
3Oct 7, 2026 22:101,43012,621,4222,308,0001,268,000524,288
4Oct 7, 2026 22:101,43112,521,3842,322,0001,257,000524,288
5Oct 7, 2026 22:101,43412,495,6032,327,0001,260,000524,288
6Oct 7, 2026 22:101,43512,479,2352,322,0001,267,000524,288
7Oct 7, 2026 22:101,43812,540,1852,329,0001,268,000524,288
8Oct 7, 2026 22:101,44812,509,0342,368,0001,254,000524,288
9Oct 7, 2026 22:101,45312,510,1072,358,0001,275,000524,288