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 8, 2026 19:54Josu San MartinJosu San MartinScore: 10,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:5410,320370,385,264336,578,0003,994,0002,289,664
2Jan 8, 2026 19:5110,338369,634,884338,156,0003,001,0002,351,104
3Jan 8, 2026 19:5110,349369,185,273337,534,0003,994,0002,342,912
4Jan 8, 2026 19:5410,356365,827,504336,764,0004,996,0002,289,664
5Jan 8, 2026 19:5410,367367,625,892338,104,0004,001,0002,330,624
6Jan 8, 2026 19:5110,397369,321,248339,099,0004,001,0002,355,200