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 listJul 21, 2025 14:36ananScore: 294,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2025 14:36293,0089,700,878,8579,586,326,00082,942,0002,338,816
2Jul 21, 2025 14:36293,5839,726,898,3439,605,295,00082,942,0002,416,640
3Jul 21, 2025 14:36294,5599,760,021,0409,634,491,00085,941,0002,363,392
4Jul 21, 2025 14:36294,6959,757,815,5589,641,984,00082,939,0002,486,272
5Jul 21, 2025 14:36294,8849,769,274,1699,656,231,00074,955,0002,293,760
6Jul 21, 2025 14:36295,9009,796,402,5089,685,781,00078,933,0002,416,640
7Jul 21, 2025 14:36296,4609,819,215,6449,696,244,00086,930,0002,519,040
8Jul 21, 2025 14:36296,9339,836,690,8599,702,865,00095,929,0002,469,888
9Jul 21, 2025 14:36297,0189,836,529,8999,720,659,00080,938,0002,334,720