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 11: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 11:560295,496,880258,489,00027,575,0002,117,632expected "1019936 ", got "1019935 "
2Jun 8, 2026 11:560294,370,565257,275,00027,791,0002,117,632expected "1022760 ", got "1022759 "
3Jun 8, 2026 11:568,666295,226,275258,252,00027,756,0002,117,632