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 10, 2026 06:57Josu San MartinJosu San MartinScore: 9,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 06:579,176326,136,877299,818,0002,998,0002,277,376
2Jan 10, 2026 06:589,197325,505,605300,522,0002,995,0002,379,776
3Jan 10, 2026 06:589,214327,478,807300,050,0004,000,0002,293,760
4Jan 10, 2026 06:579,221334,128,819300,289,0004,003,0002,383,872
5Jan 10, 2026 06:579,255328,986,297302,428,0002,994,0002,318,336
6Jan 10, 2026 06:589,258328,822,167302,524,0002,995,0002,338,816