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 23, 2025 10:16zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:41011,092,6431,657,0001,656,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:41011,092,6171,658,0001,658,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:41011,092,4751,667,0001,667,0002,121,728expected "16384 ", got "32 "stderr
4Dec 23, 2025 10:164,296163,397,442132,782,0008,985,0002,400,256
5Dec 23, 2025 10:164,344164,526,292134,327,0009,022,0002,383,872
6Dec 23, 2025 10:164,347168,189,238133,432,00010,032,0002,392,064