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 17, 2026 00:08Dominique GarmierDominique GarmierScore: 162,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 00:08160,8415,334,940,3285,288,754,00018,988,0002,342,912
2Mar 17, 2026 00:08162,5435,398,398,5785,342,948,00020,984,0002,355,200
3Mar 17, 2026 00:08164,5705,463,863,8435,405,840,00024,985,0002,310,144