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 14, 2025 08:25Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 20:37Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 20:43083,570,22565,816,0006,817,0002,113,536expected "2103312 ", got "1187029 "
2Oct 15, 2026 20:43040,977,69623,136,0006,602,0002,113,536expected "261425 ", got "197012 "
3Oct 15, 2026 20:43012,408,38102,001,0002,121,728expected "241 ", got "193 "
4Dec 14, 2025 08:257,992293,792,605255,749,0007,992,0002,510,848
5Dec 14, 2025 08:258,048296,121,811256,608,0008,986,0002,465,792
6Dec 14, 2025 08:258,270303,048,932263,923,0008,997,0002,273,280