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 22, 2025 10:59Rajarshi BasuRajarshi BasuScore: 4,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 10:584,839190,215,483156,698,0002,994,0002,285,568
2Dec 22, 2025 10:594,852186,960,905157,128,0003,002,0002,387,968
3Dec 22, 2025 10:584,858188,804,663157,293,0003,005,0002,273,280
4Dec 22, 2025 10:594,872186,268,013158,787,0001,997,0002,281,472
5Dec 22, 2025 10:584,876185,693,726157,903,0002,998,0002,285,568
6Dec 22, 2025 10:595,427204,872,788176,093,0003,001,0002,379,776