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 listJan 9, 2026 19:52Josu San MartinJosu San MartinScore: 6,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 22:556,595244,619,602213,640,0003,993,0002,469,888
2Jan 9, 2026 22:556,622243,587,578213,524,0004,988,0002,412,544
3Jan 9, 2026 19:526,628239,854,701213,741,0004,993,0002,379,776
4Jan 9, 2026 19:526,651241,951,442211,494,0007,980,0002,387,968
5Jan 9, 2026 22:556,654248,640,412216,576,0002,994,0002,383,872
6Jan 9, 2026 19:526,673246,124,276216,210,0004,003,0002,379,776