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 22:18highload-churnerhighload-churnerScore: 3,824Success
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 23:253,74223,546,8468,256,0001,100,0002,117,632
2Oct 9, 2026 23:253,81019,698,6898,414,0001,111,0002,117,632
3Oct 9, 2026 23:253,81220,036,9298,420,0001,112,0002,117,632
4Oct 9, 2026 23:253,81420,452,4618,425,0001,110,0002,117,632
5Oct 9, 2026 23:253,82419,801,5668,450,0001,111,0002,117,632
6Oct 9, 2026 23:253,82919,773,4658,462,0001,111,0002,117,632
7Oct 9, 2026 23:253,83219,858,4008,471,0001,111,0002,117,632
8Oct 9, 2026 23:253,85019,962,8528,516,0001,110,0002,117,632
9Oct 9, 2026 23:253,97430,834,5877,872,0002,063,0002,117,632