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:07Emanuele BolognesiEmanuele BolognesiScore: 46,020Success
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:0744,2951,491,682,1171,442,745,00018,996,0002,392,064
2May 24, 2025 16:0744,7421,506,221,1741,458,496,00017,993,0002,416,640
3May 24, 2025 16:0745,9561,544,836,1581,503,559,00012,987,0002,285,568
4May 24, 2025 16:0745,9981,544,650,1911,505,942,00011,991,0002,273,280
5May 24, 2025 16:0746,0201,551,990,4941,504,677,00013,987,0002,510,848
6May 24, 2025 16:0746,1031,546,137,8631,506,396,00014,993,0002,338,816
7May 24, 2025 16:0746,2211,555,714,0271,509,296,00015,992,0002,277,376
8May 24, 2025 16:0746,3491,562,223,3351,512,520,00016,983,0002,400,256
9May 24, 2025 16:0746,4791,561,389,3971,523,826,0009,992,0002,326,528