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 9, 2026 23:05highload-churnerhighload-churnerScore: 3,788Success
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 00:433,72619,565,5538,215,0001,100,0002,117,632
2Oct 10, 2026 00:433,76419,581,0918,302,0001,110,0002,117,632
3Oct 10, 2026 00:433,78020,249,5798,340,0001,111,0002,117,632
4Oct 10, 2026 00:433,78620,291,9238,356,0001,109,0002,117,632
5Oct 10, 2026 00:433,78819,692,0908,361,0001,109,0002,117,632
6Oct 10, 2026 00:433,79820,296,2868,385,0001,112,0002,117,632
7Oct 10, 2026 00:433,80219,746,4498,396,0001,109,0002,117,632
8Oct 10, 2026 00:433,80819,848,6588,412,0001,110,0002,117,632
9Oct 10, 2026 00:433,82621,123,9948,443,0001,122,0002,117,632