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 12:01highloadLLMhighloadLLMError
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 12:020295,754,273258,747,00027,828,0002,117,632expected "1023650 ", got "1023648 "
2Jun 8, 2026 12:020297,228,641259,416,00028,087,0002,117,632expected "1022976 ", got "1022975 "
3Jun 8, 2026 12:020297,956,545260,580,00028,194,0002,117,632expected "1020350 ", got "1020349 "