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 listJul 15, 2024 02:49Jasper EdbrookeJasper EdbrookeScore: 301,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2024 02:49299,7719,953,625,0959,892,458,77502,199,552
2Jul 15, 2024 02:49301,0059,993,831,2379,933,160,77702,306,048
3Jul 15, 2024 02:49303,52010,073,565,05510,016,163,00802,207,744