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 19, 2026 12:49highload-churnerhighload-churnerScore: 1,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 12:501,52013,330,7442,670,0001,130,000524,288
2Oct 19, 2026 12:501,58713,283,0142,796,0001,173,000524,288
3Oct 19, 2026 12:501,60213,224,4862,913,0001,093,000524,288
4Oct 19, 2026 12:501,60913,211,3752,931,0001,093,000524,288
5Oct 19, 2026 12:501,67413,433,8453,109,0001,076,000524,288
6Oct 19, 2026 12:501,73113,556,3153,236,0001,093,000524,288
7Oct 19, 2026 12:501,76413,761,3133,341,0001,069,000524,288
8Oct 19, 2026 12:501,77413,740,2923,342,0001,093,000524,288
9Oct 19, 2026 12:501,81114,222,4553,435,0001,094,000524,288