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 08:27Rajarshi BasuRajarshi BasuScore: 5,243Success
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 08:275,217194,736,196168,155,0004,003,0002,519,040
2Dec 20, 2025 08:275,232195,867,298167,679,0004,990,0002,281,472
3Dec 20, 2025 08:275,234198,264,538168,743,0003,993,0002,486,272
4Dec 20, 2025 08:275,239201,009,163168,891,0003,997,0002,314,240
5Dec 20, 2025 08:275,243196,069,218168,015,0005,000,0002,506,752
6Dec 20, 2025 08:275,248197,724,365166,169,0007,007,0002,326,528
7Dec 20, 2025 08:275,251199,319,872167,274,0006,009,0002,461,696
8Dec 20, 2025 08:275,260203,059,423167,599,0005,985,0002,519,040
9Dec 20, 2025 08:275,356198,727,331173,765,0002,995,0002,514,944