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 listDec 11, 2025 19:31Rajarshi BasuRajarshi BasuScore: 15,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 19:3115,140526,732,227474,630,00024,980,0002,396,160
2Dec 11, 2025 19:3115,234531,302,986485,733,00016,990,0002,285,568
3Dec 11, 2025 19:3115,284531,455,308485,402,00018,976,0002,265,088
4Dec 11, 2025 19:3115,308532,946,358486,167,00019,006,0002,396,160
5Dec 11, 2025 19:3115,321532,415,683484,617,00020,983,0002,396,160
6Dec 11, 2025 19:3115,422537,060,552490,929,00017,997,0002,408,448
7Dec 11, 2025 19:3115,507538,883,649489,730,00021,987,0002,408,448
8Dec 11, 2025 19:3115,564547,108,052496,611,00016,986,0002,498,560
9Dec 11, 2025 19:3115,619549,438,132495,436,00019,977,0002,433,024