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 07:55highloadLLMhighloadLLMError
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 07:5605,065,071,2554,999,257,00056,431,0002,113,536expected "1018950 ", got "30000000 1017167 1018928 1018950 1018950 1018950 "
2Jun 8, 2026 07:5605,096,021,2625,028,213,00058,562,0002,113,536expected "1019888 ", got "30000000 1018119 1019858 1019888 1019888 1019888 "
3Jun 8, 2026 07:5605,113,536,3385,047,607,00056,676,0002,113,536expected "1018568 ", got "30000000 1016825 1018541 1018567 1018568 1018568 "