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 10, 2026 00:20highload-churnerhighload-churnerScore: 3,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:513,68919,463,0698,124,0001,100,0002,117,632
2Oct 10, 2026 01:513,75020,134,4418,268,0001,109,0002,117,632
3Oct 10, 2026 01:513,76019,616,9908,294,0001,108,0002,117,632
4Oct 10, 2026 01:513,76219,685,2628,297,0001,109,0002,117,632
5Oct 10, 2026 01:513,76619,665,6258,307,0001,110,0002,117,632
6Oct 10, 2026 01:513,77020,121,6888,316,0001,109,0002,117,632
7Oct 10, 2026 01:513,77519,710,0498,329,0001,109,0002,117,632
8Oct 10, 2026 01:513,82619,814,0768,457,0001,110,0002,117,632
9Oct 10, 2026 01:513,82720,364,5168,458,0001,111,0002,117,632