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:38Rajarshi BasuRajarshi BasuScore: 25,178Success
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:3824,983851,917,425810,462,00013,990,0002,355,200
2Dec 11, 2025 15:3825,065859,523,467812,174,00014,984,0002,523,136
3Dec 11, 2025 15:3825,106852,960,027816,502,00011,992,0002,420,736
4Dec 11, 2025 15:3825,130855,706,760816,308,00012,988,0002,424,832
5Dec 11, 2025 15:3825,178860,308,492814,877,00015,997,0002,433,024
6Dec 11, 2025 15:3825,205859,449,863816,754,00014,995,0002,424,832
7Dec 11, 2025 15:3825,293860,228,015820,679,00013,994,0002,265,088
8Dec 11, 2025 15:3825,832876,914,468836,475,00015,989,0002,375,680
9Dec 11, 2025 15:3826,953915,400,783878,461,00010,980,0002,428,928