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 21, 2026 15:28Dominique GarmierDominique GarmierScore: 64,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:2863,2152,112,482,5392,078,091,0007,996,0002,420,736
2Mar 21, 2026 15:2964,8222,166,219,7452,130,122,0008,996,0002,416,640
3Mar 21, 2026 15:2964,8752,168,646,2022,131,872,0008,995,0002,281,472
4Mar 21, 2026 15:2864,9612,172,265,6352,132,721,00010,993,0002,281,472
5Mar 21, 2026 15:2865,0222,173,692,0022,135,727,0009,994,0002,412,544
6Mar 21, 2026 15:2965,0952,178,783,7312,140,150,0007,996,0002,285,568