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 29, 2024 15:05Nguyen Thanh VinhNguyen Thanh VinhScore: 482,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 15:05481,89515,975,188,96015,902,523,04102,306,048
2Jul 29, 2024 15:05482,40515,981,023,60215,919,378,25702,289,664
3Jul 29, 2024 15:05484,64616,052,121,81115,993,303,42302,318,336