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 listJun 8, 2026 02:48anboto1anboto1Score: 5,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:515,868203,422,563182,328,00011,317,0002,117,632
2Jun 8, 2026 02:515,871203,406,309182,560,00011,203,0002,117,632
3Jun 8, 2026 02:515,879203,296,425182,734,00011,283,0002,117,632
4Jun 8, 2026 02:515,885203,970,670182,902,00011,318,0002,117,632
5Jun 8, 2026 02:515,887204,019,019183,068,00011,215,0002,117,632
6Jun 8, 2026 02:515,896203,810,487182,693,00011,900,0002,117,632
7Jun 8, 2026 02:515,942205,794,859184,673,00011,422,0002,117,632
8Jun 8, 2026 02:515,962206,024,272184,793,00011,972,0002,117,632
9Jun 8, 2026 02:515,979207,105,751185,902,00011,427,0002,117,632