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 listJun 22, 2025 16:55Ian MckibbenIan MckibbenScore: 15,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:5515,441532,485,835440,624,00068,941,0002,318,336
2Jun 22, 2025 16:5515,456536,200,221423,039,00087,008,0002,285,568
3Jun 22, 2025 16:5515,456537,257,770433,052,00077,009,0002,322,432
4Jun 22, 2025 16:5515,492539,998,456433,350,00077,883,0002,314,240
5Jun 22, 2025 16:5515,502531,689,867427,629,00083,927,0002,428,928
6Jun 22, 2025 16:5515,505534,817,348436,725,00074,952,0002,310,144
7Jun 22, 2025 16:5515,506536,593,785444,746,00066,961,0002,408,448
8Jun 22, 2025 16:5515,546538,551,521437,177,00075,857,0002,375,680
9Jun 22, 2025 16:5516,649570,401,779458,504,00090,901,0002,281,472