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 listMar 23, 2025 15:50Aniruddha DebAniruddha DebScore: 22,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 15:5022,017749,452,474712,561,00013,991,0002,510,848
2Mar 23, 2025 15:5022,041751,082,062714,373,00012,988,0002,347,008
3Mar 23, 2025 15:5022,069757,061,034717,264,00011,004,0002,322,432
4Mar 23, 2025 15:5022,075750,708,881716,470,00011,991,0002,433,024
5Mar 23, 2025 15:5022,164755,068,322718,420,00012,989,0002,465,792
6Mar 23, 2025 15:5022,182753,864,269721,022,00011,000,0002,347,008
7Mar 23, 2025 15:5022,204755,813,387718,745,00013,995,0002,338,816
8Mar 23, 2025 15:5022,348766,683,973724,488,00012,990,0002,355,200
9Mar 23, 2025 15:5022,628766,478,956735,725,00010,995,0002,519,040