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

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:23Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:460102,189,16184,230,0006,544,0002,117,632expected "2103347 ", got "1185970 "stderr
2Oct 31, 2026 16:46012,256,22501,786,0002,125,824expected "57 ", got "47 "stderr
3Oct 31, 2026 16:460100,892,71583,473,0006,537,0002,117,632expected "2109249 ", got "1193227 "stderr
4Dec 18, 2025 13:077,933287,818,157252,806,0008,993,0002,326,528
5Dec 18, 2025 13:077,980292,131,980257,342,0006,007,0002,510,848
6Dec 18, 2025 13:078,027293,079,976255,889,0008,996,0002,437,120