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 listDec 11, 2025 15:23Rajarshi BasuRajarshi BasuScore: 25,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:2325,160861,712,578813,290,00016,985,0002,334,720
2Dec 11, 2025 15:2325,238858,202,166814,844,00017,996,0002,420,736
3Dec 11, 2025 15:2325,302868,587,353819,000,00015,980,0002,367,488
4Dec 11, 2025 15:2325,327865,026,625819,810,00015,996,0002,351,104
5Dec 11, 2025 15:2325,347866,997,511822,454,00013,990,0002,396,160
6Dec 11, 2025 15:2325,365865,908,829822,030,00015,000,0002,301,952
7Dec 11, 2025 15:2325,448869,046,905820,783,00018,994,0002,424,832
8Dec 11, 2025 15:2327,311927,728,342886,300,00014,971,0002,334,720
9Dec 11, 2025 15:2328,327965,121,852916,817,00017,976,0002,424,832