Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listDec 21, 2025 23:28zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:49Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 08:570461,964,690346,198,000107,101,0002,121,728expected "2919930 ", got "1488483 "stderr
2Sep 9, 2026 08:570467,824,226350,284,000108,838,0002,121,728expected "2919932 ", got "1488595 "stderr
3Sep 9, 2026 08:570466,491,153349,703,000108,073,0002,121,728expected "2919947 ", got "1488684 "stderr
4Dec 21, 2025 23:289,508335,611,938210,846,000102,924,0002,392,064
5Dec 21, 2025 23:289,556340,722,390210,564,000104,783,0002,453,504
6Dec 21, 2025 23:289,602343,666,874211,909,000104,955,0002,510,848