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:22highload-churnerhighload-churnerScore: 1,405Success
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,27412,437,8292,111,0001,076,000524,288
2Oct 19, 2026 14:231,29312,416,4382,163,0001,070,000524,288
3Oct 19, 2026 14:231,34112,414,6872,266,0001,087,000524,288
4Oct 19, 2026 14:231,35012,596,5522,298,0001,078,000524,288
5Oct 19, 2026 14:231,40512,970,5462,412,0001,102,000524,288
6Oct 19, 2026 14:231,46212,818,3802,532,0001,123,000524,288
7Oct 19, 2026 14:231,53913,051,6802,753,0001,096,000524,288
8Oct 19, 2026 14:231,56113,143,6712,746,0001,158,000524,288
9Oct 19, 2026 14:231,57413,018,9672,837,0001,100,000524,288