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 listApr 19, 2026 06:32limanjun99limanjun99Score: 66,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 06:3265,9072,203,283,7392,096,005,00078,924,0002,338,816
2Apr 19, 2026 06:3266,0082,204,474,8752,112,310,00065,947,0002,281,472
3Apr 19, 2026 06:3266,4122,215,783,3852,114,665,00076,915,0002,445,312