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 22, 2025 10:43Rajarshi 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:55017,881,9193,531,0002,588,0002,125,824expected "48265 ", got "39502 "stderr
2Oct 31, 2026 16:55016,627,7572,351,0002,978,0002,125,824expected "20249 ", got "15696 "stderr
3Oct 31, 2026 16:5512115,359,6551,294,0002,700,0002,125,824stderr
4Dec 22, 2025 10:434,855181,294,930156,196,0004,005,0002,338,816
5Dec 22, 2025 10:434,863185,759,889156,470,0004,012,0002,351,104
6Dec 22, 2025 10:434,954190,868,071159,477,0004,012,0002,523,136