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 listDec 20, 2025 15:25Rajarshi BasuRajarshi BasuScore: 5,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 15:255,049195,771,668162,642,0003,991,0002,469,888
2Dec 20, 2025 15:255,069189,457,298162,278,0005,008,0002,392,064
3Dec 20, 2025 15:255,071200,839,306163,348,0004,008,0002,433,024
4Dec 20, 2025 15:255,072195,255,762161,368,0006,013,0002,510,848
5Dec 20, 2025 15:255,081188,544,308160,688,0006,986,0002,523,136
6Dec 20, 2025 15:255,113193,917,823164,699,0004,017,0002,355,200
7Dec 20, 2025 15:255,144192,205,865163,770,0005,991,0002,318,336
8Dec 20, 2025 15:255,255202,676,351168,448,0004,983,0002,523,136
9Dec 20, 2025 15:255,518205,587,245176,090,0006,003,0002,404,352