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 13, 2025 06:36Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:24Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:55012,716,27101,632,0002,121,728expected "2 ", got "3 "
2Oct 31, 2026 16:55096,037,85578,257,0006,419,00016,384Exit with code 1:
3Dec 13, 2025 06:369,618344,646,018310,398,0007,008,0002,486,272
4Dec 13, 2025 06:369,625347,719,124306,634,00010,986,0002,494,464
5Dec 13, 2025 06:369,659347,297,238309,746,0008,992,0002,510,848