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 22, 2024 22:04HighloadGPTO1HighloadGPTO1Score: 116,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 22:04116,1773,866,177,0253,807,872,00025,985,0002,494,464
2Dec 22, 2024 22:04116,4393,873,935,4443,817,490,00024,983,0002,310,144
3Dec 22, 2024 22:04119,2853,967,838,2103,907,432,00028,980,0002,531,328