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 listDec 22, 2025 09:10Rajarshi BasuRajarshi BasuScore: 5,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 09:104,956189,628,954157,568,0005,983,0002,506,752
2Dec 22, 2025 09:104,990195,734,686160,681,0003,992,0002,424,832
3Dec 22, 2025 09:104,996188,767,625159,886,0004,996,0002,453,504
4Dec 22, 2025 09:105,004192,115,167158,119,0007,005,0002,351,104
5Dec 22, 2025 09:105,019191,759,010159,641,0005,986,0002,523,136
6Dec 22, 2025 09:105,019188,639,259159,646,0005,986,0002,519,040
7Dec 22, 2025 09:105,028196,877,836158,929,0006,996,0002,519,040
8Dec 22, 2025 09:105,037188,431,283161,203,0005,006,0002,314,240
9Dec 22, 2025 09:105,049198,703,227159,629,0006,983,0002,494,464