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 14:23highload-churnerhighload-churnerScore: 1,482Success
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 14:231,28412,352,1022,121,0001,089,000524,288
2Oct 19, 2026 14:231,38312,652,3092,363,0001,096,000524,288
3Oct 19, 2026 14:231,40712,679,5032,410,0001,109,000524,288
4Oct 19, 2026 14:231,46612,951,9502,557,0001,108,000524,288
5Oct 19, 2026 14:231,48212,855,7552,601,0001,105,000524,288
6Oct 19, 2026 14:231,50812,939,9432,697,0001,073,000524,288
7Oct 19, 2026 14:231,50912,936,2502,646,0001,128,000524,288
8Oct 19, 2026 14:231,56113,108,4302,798,0001,106,000524,288
9Oct 19, 2026 14:231,57013,059,3822,804,0001,123,000524,288