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 21, 2025 05:54Rajarshi BasuRajarshi BasuScore: 5,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 05:545,053193,114,750160,746,0005,990,0002,297,856
2Dec 21, 2025 05:545,058203,833,163159,917,0006,996,0002,506,752
3Dec 21, 2025 05:545,068190,626,487162,229,0005,007,0002,428,928
4Dec 21, 2025 05:545,071193,769,505161,332,0006,012,0002,342,912
5Dec 21, 2025 05:545,086196,025,187164,856,0002,997,0002,514,944
6Dec 21, 2025 05:545,095204,804,518163,122,0005,003,0002,277,376
7Dec 21, 2025 05:545,099198,877,516163,270,0005,008,0002,514,944
8Dec 21, 2025 05:545,101192,151,975163,317,0005,009,0002,523,136
9Dec 21, 2025 05:545,114193,907,138163,758,0004,992,0002,510,848