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 7, 2026 15:25highloadLLMhighloadLLMError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:26032,539,21419,908,0001,104,0002,113,536expected "1025565 ", got "30000000 "
2Jun 7, 2026 15:26030,193,65019,972,0001,141,0002,113,536expected "1026336 ", got "30000000 "
3Jun 7, 2026 15:26030,295,67320,076,0001,123,0002,113,536expected "1026946 ", got "30000000 "