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 listMay 24, 2025 16:22Emanuele BolognesiEmanuele BolognesiScore: 87,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2025 16:2287,1772,911,839,3762,871,853,0004,992,0002,408,448
2May 24, 2025 16:2287,4032,919,863,6252,879,304,0004,993,0002,281,472
3May 24, 2025 16:2287,8922,931,412,9812,894,444,0005,990,0002,457,600