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 listApr 18, 2025 10:11Chandrasekaran AkashChandrasekaran AkashScore: 478,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 10:11475,84415,744,608,90015,607,909,00094,938,0002,285,568
2Apr 18, 2025 10:11478,39515,822,665,13915,689,095,00097,931,0002,285,568
3Apr 18, 2025 10:11483,35715,990,344,05215,857,833,00092,940,0002,514,944