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 20, 2025 06:59Rajarshi BasuRajarshi BasuScore: 5,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 06:595,358200,179,018169,807,0006,992,0002,527,232
2Dec 20, 2025 06:595,370203,284,743171,200,0006,007,0002,514,944
3Dec 20, 2025 06:595,372199,552,675172,276,0005,008,0002,482,176
4Dec 20, 2025 06:595,376203,544,044171,402,0006,014,0002,285,568
5Dec 20, 2025 06:595,387205,929,443170,776,0006,990,0002,523,136
6Dec 20, 2025 06:595,412206,078,472172,599,0005,986,0002,519,040