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 listSep 3, 2024 20:02Jatin YadavJatin YadavScore: 120,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 20:02120,6144,008,030,8253,951,298,00028,980,0002,277,376
2Sep 3, 2024 20:02120,9824,025,483,2723,966,423,00025,983,0002,392,064
3Sep 3, 2024 20:02121,9734,050,560,7433,999,142,00025,981,0002,277,376