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 17:06highload-churnerhighload-churnerScore: 4,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 17:124,79222,473,1779,917,0002,064,0002,117,632
2Oct 9, 2026 17:124,95522,860,85710,315,0002,073,0002,121,728
3Oct 9, 2026 17:124,96023,436,08110,319,0002,083,0002,117,632
4Oct 9, 2026 17:124,96822,906,14910,349,0002,072,0002,121,728
5Oct 9, 2026 17:124,97523,712,35410,364,0002,075,0002,117,632
6Oct 9, 2026 17:124,99023,525,13110,387,0002,088,0002,117,632
7Oct 9, 2026 17:124,99723,569,38910,410,0002,083,0002,117,632
8Oct 9, 2026 17:125,02523,085,24310,450,0002,113,0002,117,632
9Oct 9, 2026 17:125,04023,020,15810,397,0002,204,0002,117,632