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:10highload-churnerhighload-churnerScore: 3,818Success
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:523,78219,874,5388,347,0001,109,0002,117,632
2Oct 10, 2026 00:523,79820,280,3188,385,0001,110,0002,117,632
3Oct 10, 2026 00:523,80520,359,2238,404,0001,110,0002,117,632
4Oct 10, 2026 00:523,80820,317,1488,412,0001,109,0002,117,632
5Oct 10, 2026 00:523,81820,380,4518,434,0001,113,0002,117,632
6Oct 10, 2026 00:523,82019,792,2248,439,0001,112,0002,117,632
7Oct 10, 2026 00:523,82320,315,9058,447,0001,111,0002,117,632
8Oct 10, 2026 00:523,85420,499,9918,512,0001,125,0002,117,632
9Oct 10, 2026 00:523,85619,927,8878,516,0001,124,0002,117,632