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 listJul 12, 2025 17:04Aniruddha DebAniruddha DebScore: 376,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2025 17:04374,89412,409,852,86112,272,564,00098,940,0002,297,856
2Jul 12, 2025 17:04376,90612,473,245,44612,317,974,000119,931,0002,277,376
3Jul 12, 2025 17:04377,76012,500,272,45512,364,145,000101,935,0002,498,560