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 listFeb 26, 2025 17:08AdityaAdityaScore: 163,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 17:08160,5215,331,145,8625,271,198,00025,986,0002,437,120
2Feb 26, 2025 17:08161,0555,345,921,1395,283,840,00030,981,0002,428,928
3Feb 26, 2025 17:08161,7605,369,852,3745,310,107,00027,979,0002,363,392
4Feb 26, 2025 17:08162,1095,381,203,8355,321,608,00027,982,0002,351,104
5Feb 26, 2025 17:08163,8935,445,641,7495,373,486,00034,977,0002,371,584
6Feb 26, 2025 17:08164,0715,443,120,7315,386,372,00027,981,0002,400,256
7Feb 26, 2025 17:08165,2465,485,564,6055,428,122,00024,982,0002,408,448
8Feb 26, 2025 17:08165,2615,485,557,5265,424,627,00028,981,0002,457,600
9Feb 26, 2025 17:08165,6985,503,322,0435,442,068,00025,981,0002,519,040