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 listMar 17, 2026 01:15Josu San MartinJosu San MartinScore: 4,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 01:154,090161,443,019132,975,0001,999,0002,387,968
2Mar 17, 2026 01:154,094156,569,309133,085,0002,001,0002,408,448
3Mar 17, 2026 01:144,095157,342,060134,140,0001,001,0002,404,352
4Mar 17, 2026 01:144,098157,290,212133,219,0002,003,0002,289,664
5Mar 17, 2026 01:154,098157,412,810134,246,0001,001,0002,404,352
6Mar 17, 2026 01:154,099156,259,926134,262,0001,001,0002,289,664
7Mar 17, 2026 01:154,129156,295,873134,241,0002,003,0002,408,448
8Mar 17, 2026 01:144,155160,289,725136,112,0001,000,0002,289,664
9Mar 17, 2026 01:154,191160,807,448137,312,0001,002,0002,404,352