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 17, 2026 07:46janwwwjanwwwScore: 1,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 07:461,65314,902,8962,892,0001,241,0002,121,728
2Oct 17, 2026 07:461,67614,899,9932,946,0001,246,0002,121,728
3Oct 17, 2026 07:461,67914,947,1552,947,0001,252,0002,121,728
4Oct 17, 2026 07:461,68014,915,7342,949,0001,252,0002,121,728
5Oct 17, 2026 07:461,68714,898,5402,954,0001,265,0002,121,728
6Oct 17, 2026 07:461,68914,908,9412,954,0001,269,0002,121,728
7Oct 17, 2026 07:461,69014,890,3272,962,0001,263,0002,121,728
8Oct 17, 2026 07:461,69214,843,5192,955,0001,275,0002,121,728
9Oct 17, 2026 07:461,91715,548,8533,550,0001,244,0002,121,728