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 listFeb 20, 2025 11:33Oleg KovalovOleg KovalovScore: 161,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2025 11:33158,3025,249,417,1455,195,978,00027,989,0002,416,640
2Feb 20, 2025 11:33161,8005,369,999,8805,309,404,00029,985,0002,535,424
3Feb 20, 2025 11:33162,2805,387,007,5625,320,256,00034,975,0002,351,104