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 listMar 18, 2026 01:25Josu San MartinJosu San MartinScore: 4,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 01:294,263166,741,659137,695,0002,993,0002,457,600
2Mar 18, 2026 01:254,272164,197,654137,991,0002,999,0002,285,568
3Mar 18, 2026 01:294,273163,978,122139,994,000999,0002,461,696
4Mar 18, 2026 01:254,277161,681,620139,147,0002,002,0002,285,568
5Mar 18, 2026 01:254,278167,244,851138,170,0003,003,0002,260,992
6Mar 18, 2026 01:294,279164,820,252139,209,0002,003,0002,277,376