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 21, 2025 04:01xffoxxffoxScore: 464,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 04:01462,06615,283,107,01615,153,244,00094,945,0002,301,952
2Dec 21, 2025 04:01463,70315,341,023,84115,186,283,000115,925,0002,400,256
3Dec 21, 2025 04:01464,18315,354,662,82915,217,099,000100,940,0002,334,720
4Dec 21, 2025 04:01464,35115,359,143,64615,230,631,00092,948,0002,449,408
5Dec 21, 2025 04:01464,61215,367,114,00115,245,257,00086,950,0002,326,528
6Dec 21, 2025 04:01466,52715,433,934,75515,287,448,000107,939,0002,523,136
7Dec 21, 2025 04:01466,60115,433,127,78815,307,898,00089,946,0002,494,464
8Dec 21, 2025 04:01468,40915,493,015,69015,360,567,00096,946,0002,273,280
9Dec 21, 2025 04:01475,32815,726,014,29715,574,874,000110,935,0002,449,408