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 15:07Emanuele BolognesiEmanuele BolognesiScore: 85,975Success
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 15:0783,3112,777,550,7072,726,288,00022,985,0002,310,144
2May 24, 2025 15:0783,9612,802,281,9782,749,739,00020,990,0002,523,136
3May 24, 2025 15:0785,2332,851,104,8382,793,692,00018,991,0002,449,408
4May 24, 2025 15:0785,4132,847,055,4392,800,625,00017,991,0002,457,600
5May 24, 2025 15:0785,9752,871,848,4612,815,183,00021,985,0002,449,408
6May 24, 2025 15:0786,3352,881,828,1832,822,060,00026,981,0002,420,736
7May 24, 2025 15:0786,6372,891,868,0412,834,035,00024,982,0002,523,136
8May 24, 2025 15:0786,8222,892,348,5032,842,151,00022,985,0002,404,352
9May 24, 2025 15:0787,4402,912,221,5202,863,536,00021,988,0002,457,600