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 listJan 27, 2025 22:21Oleg KovalovOleg KovalovScore: 317,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 22:21314,21610,402,162,92710,280,185,00088,949,0002,490,368
2Jan 27, 2025 22:21317,90910,521,571,11610,401,048,00089,948,0002,428,928
3Jan 27, 2025 22:21319,15410,566,651,94010,441,141,00090,940,0002,433,024