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 10, 2025 13:54Emanuele BolognesiEmanuele BolognesiScore: 100,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 13:5499,8303,322,489,8363,288,405,0005,997,0002,277,376
2May 10, 2025 13:54100,2923,338,404,9823,305,624,0003,998,0002,326,528
3May 10, 2025 13:54100,6613,353,746,8303,314,803,0006,995,0002,285,568