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, 2024 00:10Hayden DonnellyHayden DonnellyScore: 439,419Success
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, 2024 00:10437,90014,483,044,73614,365,743,00084,945,0002,523,136
2Dec 11, 2024 00:10439,41914,538,275,41614,398,889,000101,928,0002,387,968
3Dec 11, 2024 00:10439,83314,548,030,45614,424,545,00089,947,0002,375,680